Enumeration of Standard Young Tableaux
A survey paper, to appear as a chapter in a forthcoming Handbook on Enumeration.
math.CO↗
arXiv subjects
Ron M. Adin
Publications and source records attributed to Ron M. Adin.
On maximal chains in the non-crossing partition lattice
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element.
math.CO↗
Flag weak order on wreath products
A generating set for the wreath product $\ZZ_r \wr S_n$ which leads to a nicely behaved weak order is presented, and properties of the resulting order are studied.
math.CO↗
Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are deduced. In particular, it is shown that: (1) every diagonal is flipped exactly once in a geodesic between distinguished pairs of antipodes; (2) the number of geodesics between these antipodes is equal to twice the number of Young tableaux of a truncated shifted staircase shape.
math.CO↗
Enumeration of standard Young tableaux of certain truncated shapes
Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE corner, and some variations.
math.CO↗
Triangle-Free Triangulations
The flip operation on colored inner-triangle-free triangulations of a convex polygon is studied. It is shown that the affine Weyl group $\widetilde{C}_n$ acts transitively on these triangulations by colored flips, and that the resulting colored flip graph is closely related to a lower interval in the weak order on $\widetilde{C}_n$. Lattice properties of this order are then applied to compute the diameter.
math.CO↗
Combinatorial Gelfand Models
A combinatorial construction of a Gelafand model for the symmetric group and its Iwahori-Hecke algebra is presented.
math.RT↗
A Gelfand Model for Wreath Products
A Gelafand model for wreath products $\Z_r\wr S_n$ is constructed. The proof relies on a combinatorial interpretation of the characters of the model, extending a classical result of Frobenius and Schur.
math.RT↗
Major Indices and Perfect Bases for Complex Reflection Groups
It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert series identity to these and other closely related groups.
math.CO↗
The Combinatorics of the Garsia-Haiman Modules for Hook Shapes
Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a decomposition of the Garsia-Haiman modules into descent representations.
math.RT↗
A Construction of Coxeter Group Representations (II)
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is investigated in detail. The resulting representations are completely classified and include the irreducible ones.
math.RT↗
On Degrees in the Hasse Diagram of the Strong Bruhat Order
For a permutation $π$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $π$ in the strong Bruhat order. The maxima of the total degree and the down degree and their values at a random permutation are computed. Proofs involve variants of a classical theorem of Turán from extremal graph theory.
math.CO↗
A Unified Construction of Coxeter Group Representations (I)
An elementary approach to the construction of Coxeter group representations is presented.
math.RT↗
Rim Hook Tableaux and Kostant's $η$-Function Coefficients
Using a 0/1 encoding of Young diagrams and its consequences for rim hook tableaux, we prove a reduction formula of Littlewood for arbitrary characters of the symmetric group, evaluated at elements with all cycle lengths divisible by a given integer. As an application, we find explicitly the coefficients in a formula of Kostant for certain powers of the Dedekind $η$-function, avoiding most of the original machinery.
math.CO↗
Signed Mahonians
A classical result of MacMahon gives a simple product formula for the generating function of major index over the symmetric group. A similar factorial-type product formula for the generating function of major index together with sign was given by Gessel and Simion. Several extensions are given in this paper, including a recurrence formula, a specialization at roots of unity and type $B$ analogues.
math.CO↗
Equidistribution and Sign-Balance on 321-Avoiding Permutations
Let $T_n$ be the set of 321-avoiding permutations of order $n$. Two properties of $T_n$ are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over $T_n$, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for $T_{2n}$ and $T_{2n+1}$ are essentially equal to the last-descent enumerator for $T_n$. The proofs use a recursion formula for an appropriate multivariate generating function.
math.CO↗
Descent Representations and Multivariate Statistics
Combinatorial identities on Weyl groups of types $A$ and $B$ are derived from special bases of the corresponding coinvariant algebras. Using the Garsia-Stanton descent basis of the coinvariant algebra of type $A$ we give a new construction of the Solomon descent representations. An extension of the descent basis to type $B$, using new multivariate statistics on the group, yields a refinement of the descent representations. These constructions are then applied to refine well-known decomposition rules of the coinvariant algebra and to generalize various identities.
math.CO↗
Hook Interpolations
The hook components of $V^{\otimes n}$ interpolate between the symmetric power $\sym^n(V)$ and the exterior power $\wedge^n(V)$. When $V$ is the vector space of $k\times m$ matrices over $\bbc$, we decompose the hook components into irreducible $GL_k(\bbc)\times GL_m(\bbc)$-modules. In particular, classical theorems are proved as boundary cases. For the algebra of square matrices over $\bbc$, a bivariate interpolation is presented and studied.
math.RT↗