P-strict promotion and B-bounded rowmotion, with applications to tableaux of many flavors
From MaRDI portal
Publication:5048445
DOI10.5070/C61055369zbMATH Open1498.05034arXiv2012.12219OpenAlexW3179374937MaRDI QIDQ5048445FDOQ5048445
Authors: Joseph Bernstein, Jessica Striker, Corey Vorland
Publication date: 16 November 2022
Published in: Combinatorial Theory (Search for Journal in Brave)
Abstract: We define P-strict labelings for a finite poset P as a generalization of semistandard Young tableaux and show that promotion on these objects is in equivariant bijection with a toggle action on B-bounded Q-partitions of an associated poset Q. In many nice cases, this toggle action is conjugate to rowmotion. We apply this result to flagged tableaux, Gelfand-Tsetlin patterns, and symplectic tableaux, obtaining new cyclic sieving and homomesy conjectures. We also show P-strict promotion can be equivalently defined using Bender-Knuth and jeu de taquin perspectives.
Full work available at URL: https://arxiv.org/abs/2012.12219
Recommendations
Combinatorial identities, bijective combinatorics (05A19) Group actions on combinatorial structures (05E18)
Cites Work
- Flagged Schur functions, Schubert polynomials, and symmetrizing operators
- Orbits of antichains revisited
- Homomesy in products of two chains
- Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
- Promotion and rowmotion
- Piecewise-linear and birational toggling
- Title not available (Why is that?)
- Iterative properties of birational rowmotion. II: Rectangles and triangles.
- Title not available (Why is that?)
- The cyclic sieving phenomenon
- Subword complexes, cluster complexes, and generalized multi-associahedra
- Promotion and evacuation
- Promotion des morphismes d'ensembles ordonnes
- Cyclic sieving, promotion, and representation theory
- Ordered structures and partitions
- Lattice path proofs for determinantal formulas for symplectic and orthogonal characters
- Affine type \(A\) geometric crystal on the Grassmannian
- Enumeration of plane partitions
- A uniform bijection between nonnesting and noncrossing partitions
- Sur les hypergraphes invariants
- The cyclic sieving phenomenon for faces of generalized cluster complexes
- Proofs and generalizations of a homomesy conjecture of Propp and Roby
- On the equality of two plane partition correspondences
- Resonance in orbits of plane partitions and increasing tableaux
- Dynamical algebraic combinatorics and the homomesy phenomenon
- Paths to understanding birational rowmotion on products of two chains
- Cyclic sieving for plane partitions and symmetry
- Rowmotion and increasing labeling promotion
- Dynamical algebraic combinatorics: promotion, rowmotion, and resonance
- Hook-content formulae for symplectic and orthogonal tableaux
Cited In (10)
- Rowmotion Markov chains
- A refinement of the Murnaghan-Nakayama rule by descents for border strip tableaux
- Homomesy via toggleability statistics
- A cyclic sieving phenomenon for symplectic tableaux
- Permutoric promotion: gliding globs, sliding stones, and colliding coins
- \(P\)-strict promotion and \(Q\)-partition rowmotion: the graded case
- Toric promotion
- \(P\)-strict promotion and piecewise-linear rowmotion, with applications to flagged tableaux
- Promotion of increasing tableaux: frames and homomesies
- Increasing labelings, generalized promotion and rowmotion
Uses Software
This page was built for publication: \(P\)-strict promotion and \(B\)-bounded rowmotion, with applications to tableaux of many flavors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048445)