A natural bijection between permutations and a family of descending plane partitions

DOI10.1016/J.EJC.2010.02.003zbMATH Open1227.05005OpenAlexW2069556937MaRDI QIDQ709248FDOQ709248

Authors A. Ayyer

Publication date 18 October 2010

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.4732

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Abstract: We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of the bijection is that it provides an interpretation for the seemingly long list of conditions needed to define descending plane partitions. Unfortunately, the bijection does not relate the number of parts of the descending plane partition with the number of inversions of the permutation as one might have expected from the conjecture of Mills, Robbins and Rumsey, although there is a simple expression for the number of inversions of a permutation in terms of the corresponding descending plane partition.

Recommendations

• A direct bijection between descending plane partitions with no special parts and permutation matrices
• A statistics-respecting bijection between permutation matrices and descending plane partitions without special parts
• Bijections for permutation tableaux
• Bijections for permutation tableaux

Cites work

• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• Alternating sign matrices and descending plane partitions
• Binomial determinants, paths, and hook length formulae
• Dave Robbins' art of guessing
• Descending plane partitions and rhombus tilings of a hexagon with a triangular hole
• Lattice paths and the antiautomorphism of the poset of descending plane partitions
• Plane partitions. III: The weak Macdonald conjecture
• Proof of the Macdonald conjecture

Cited in

(8)

• Weight-preserving bijections between integer partitions and a class of alternating sign trapezoids
• A direct bijection between descending plane partitions with no special parts and permutation matrices
• Multiply-refined enumeration of alternating sign matrices
• Weight-preserving bijections between integer partitions and a family of alternating sign trapezoids
• Enumeration of plane partitions by descents
• On the weighted enumeration of alternating sign matrices and descending plane partitions
• A statistics-respecting bijection between permutation matrices and descending plane partitions without special parts
• Lattice paths and the antiautomorphism of the poset of descending plane partitions

This page was built for publication: A natural bijection between permutations and a family of descending plane partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709248)