A direct bijection between descending plane partitions with no special parts and permutation matrices
From MaRDI portal
Publication:409382
DOI10.1016/J.DISC.2011.07.030zbMATH Open1247.05026arXiv1002.3391OpenAlexW2005089487MaRDI QIDQ409382FDOQ409382
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the inversion number of the permutation. Additionally, the number of maximum parts in the descending plane partition corresponds to the position of the one in the last column of the permutation matrix. We also discuss the possible extension of this approach to finding a bijection between descending plane partitions and alternating sign matrices.
Full work available at URL: https://arxiv.org/abs/1002.3391
Recommendations
- A statistics-respecting bijection between permutation matrices and descending plane partitions without special parts
- A natural bijection between permutations and a family of descending plane partitions
- A direct bijection between permutations and a subclass of totally symmetric self-complementary plane partitions
- The relation between alternating sign matrices and descending plane partitions: \(n + 3\) pairs of equivalent statistics
- Enumeration of plane partitions by descents
Cites Work
- Proof of the alternating sign matrix conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the weighted enumeration of alternating sign matrices and descending plane partitions
- Alternating sign matrices and descending plane partitions
- Proof of the Macdonald conjecture
- Proof of the Razumov-Stroganov conjecture
- Alternating sign matrices with one \(-1\) under vertical reflection
- A unifying poset perspective on alternating sign matrices, plane partitions, Catalan objects, tournaments, and tableaux
- A natural bijection between permutations and a family of descending plane partitions
Cited In (9)
- Promotion and rowmotion
- Trivial meet and join within the lattice of monotone triangles.
- On the weighted enumeration of alternating sign matrices and descending plane partitions
- Multiply-refined enumeration of alternating sign matrices
- Weight-preserving bijections between integer partitions and a class of alternating sign trapezoids
- Sign matrix polytopes from Young tableaux
- Weight-preserving bijections between integer partitions and a family of alternating sign trapezoids
- A statistics-respecting bijection between permutation matrices and descending plane partitions without special parts
- Permutation totally symmetric self-complementary plane partitions
Uses Software
This page was built for publication: A direct bijection between descending plane partitions with no special parts and permutation matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409382)