International audienceWe prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the combinatorial point and hence to enumerations of Alternating Sign Matrices. A consequence of our result is an identity concerning the doubly-refined enumerations of Alternating Sign Matrices
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs...
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASAS...
AbstractWe enumerate the alternating sign matrices that contain exactly one −1 according to their nu...
International audienceWe prove a determinantal identity concerning Schur functions for 2-staircase d...
International audienceWe prove a determinantal identity concerning Schur functions for 2-staircase d...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
AbstractWe study a further refinement of the standard refined enumeration of alternating sign matric...
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASAS...
International audienceWe study the enumeration of diagonally and antidiagonally symmetric alternatin...
AbstractZeilberger (1996) [12] proved the Refined Alternating Sign Matrix Theorem, which gives a pro...
AbstractThis paper highlights three known identities, each of which involves sums over alternating s...
AbstractWe study a further refinement of the standard refined enumeration of alternating sign matric...
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs...
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASAS...
AbstractWe enumerate the alternating sign matrices that contain exactly one −1 according to their nu...
International audienceWe prove a determinantal identity concerning Schur functions for 2-staircase d...
International audienceWe prove a determinantal identity concerning Schur functions for 2-staircase d...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign...
AbstractWe study a further refinement of the standard refined enumeration of alternating sign matric...
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASAS...
International audienceWe study the enumeration of diagonally and antidiagonally symmetric alternatin...
AbstractZeilberger (1996) [12] proved the Refined Alternating Sign Matrix Theorem, which gives a pro...
AbstractThis paper highlights three known identities, each of which involves sums over alternating s...
AbstractWe study a further refinement of the standard refined enumeration of alternating sign matric...
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs...
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASAS...
AbstractWe enumerate the alternating sign matrices that contain exactly one −1 according to their nu...