Combinatorial Identities for Vacillating Tableaux
Authors:
- Zhanar BerikkyzyZBZhanar Berikkyzy
- Pamela E. HarrisPHPamela E. Harris
- Anna PunAPAnna Pun
- Catherine YanCYCatherine Yan
- Chenchen ZhaoCZChenchen Zhao
Preprint
Abstract
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and nestings of matchings and set partitions. In this paper, we further investigate the enumeration of vacillating tableaux and derive multiple combinatorial identities and integer sequences relating to the number of vacillating tableaux, simplified vacillating tableaux, and limiting vacillating tableaux.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoesJournal of Combinatorial Theory, Series A, 2020
- An insertion algorithm on multiset partitions with applications to diagram algebrasJournal of Algebra, 2020
- A study of a family of generating functions of Nelsen–Schmidt type and some identities on restricted barred preferential arrangementsDiscrete Mathematics, 2017
- Dimensions of irreducible modules for partition algebras and tensor power multiplicities for symmetric and alternating groupsJournal of Algebraic Combinatorics, 2017
- Increasing and decreasing sequences in fillings of moon polyominoesAdvances in Applied Mathematics, 2011
- q-Partition algebra combinatoricsJournal of Combinatorial Theory, Series A, 2010
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapesAdvances in Applied Mathematics, 2006
- The Potts model representation and a Robinson–Schensted correspondence for the partition algebraCompositio Mathematica, 1998
- Non-crossing partitions for classical reflection groupsDiscrete Mathematics, 1997
- The Cauchy identity for Sp(2n)Journal of Combinatorial Theory, Series A, 1990