Add to ORKGIt has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a x b x c. In this note, this result is proved by constructing explicitly the bijection between these FPL and plane partitions
Abstract. Fully Packed Loop configurations in a triangle (TFPLs) first appeared in the study of ordi...
We study bijections { Set partitions of type X} −̃ → { Set partitions of type X} for X ∈ {A,B,C,D},...
We continue our study of partitions of the full set of fenced(frac(v, 3)) triples chosen from a v-se...
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b ...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
22 pages, TeX, 16 figures; a new formula for a generating function addedThe problem of counting the ...
AnS-LaTeX, 43 pages; Journal versionWe show that the number of fully packed loop configurations corr...
AbstractIt follows from the work of Andrews and Bressoud that fort⩽1, the number of partitions ofnwi...
International audienceCylindric plane partitions may be thought of as a natural generalization of re...
40 pages, 31 figuresInternational audienceFully Packed Loop configurations in a triangle (TFPLs) fir...
The combinatorial theory of partitions has a number of applications including the representation the...
Abstract. We are interested in the enumeration of Fully Packed Loop config-urations on a grid with a...
AbstractWe are interested in the enumeration of Fully Packed Loop configurations on a grid with a gi...
AbstractWe introduce a new symmetry operation, called complementation, on plane partitions whose thr...
Abstract. Fully Packed Loop configurations in a triangle (TFPLs) first appeared in the study of ordi...
We study bijections { Set partitions of type X} −̃ → { Set partitions of type X} for X ∈ {A,B,C,D},...
We continue our study of partitions of the full set of fenced(frac(v, 3)) triples chosen from a v-se...
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b ...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
22 pages, TeX, 16 figures; a new formula for a generating function addedThe problem of counting the ...
AnS-LaTeX, 43 pages; Journal versionWe show that the number of fully packed loop configurations corr...
AbstractIt follows from the work of Andrews and Bressoud that fort⩽1, the number of partitions ofnwi...
International audienceCylindric plane partitions may be thought of as a natural generalization of re...
40 pages, 31 figuresInternational audienceFully Packed Loop configurations in a triangle (TFPLs) fir...
The combinatorial theory of partitions has a number of applications including the representation the...
Abstract. We are interested in the enumeration of Fully Packed Loop config-urations on a grid with a...
AbstractWe are interested in the enumeration of Fully Packed Loop configurations on a grid with a gi...
AbstractWe introduce a new symmetry operation, called complementation, on plane partitions whose thr...
Abstract. Fully Packed Loop configurations in a triangle (TFPLs) first appeared in the study of ordi...
We study bijections { Set partitions of type X} −̃ → { Set partitions of type X} for X ∈ {A,B,C,D},...
We continue our study of partitions of the full set of fenced(frac(v, 3)) triples chosen from a v-se...