2000 character limit reached
A bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruplet of statistics considered by Behrend, Di Francesco and Zinn--Justin
Published 14 Jun 2018 in math.CO | (1806.05381v2)
Abstract: We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the inversion words of permutations and the "usual" representation of descending plane partitions as families of non--intersec-ting lattice paths.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.