Cyclic descents for near-hook and two-row shapes

DOI10.1016/J.EJC.2019.02.009MaRDI QIDQ2422236zbMATH OpenOpenAlexFDO

Authors Ron Adin, Sergi Elizalde, Yuval Roichman

Publication date 18 June 2019

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

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

zbMATH Keywords

standard Young tableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Abstract: A notion of cyclic descents on standard Young tableaux (SYT) of rectangular shape was introduced by Rhoades, and extended to certain skew shapes by the last two authors. The cyclic descent set restricts to the usual descent set when the largest value is ignored, and has the property that the number of SYT of a given shape with a given cyclic descent set $D$ is invariant under cyclic shifts of the entries of $D$. Following these results, the existence of cyclic descent sets for standard Young tableaux of any skew shape other than a ribbon was conjectured by the authors, and recently proved by Adin, Reiner and Roichman. Unfortunately, the proof does not provide a natural definition of the cyclic descent set for a specific tableau. In this paper we explicitly describe cyclic descent sets and resulting generating functions for SYT of (possibly skew) shapes which either have exactly two rows or are near-hooks, i.e., are one cell away from a hook. Our definition provides a constructive combinatorial proof of the existence of cyclic descent sets for these shapes, and coincides with that of Rhoades for two-row rectangular shapes. We also show that cyclic descent sets for near-hook shaped tableaux are unique.

Recommendations

• Cyclic descents for Motzkin paths
• Cyclic descents for general skew tableaux
• On cyclic descents for tableaux
• On cyclic descents for tableaux
• Cyclic descents, matchings and Schur-positivity

Cites work

• Affine descents and the Steinberg torus
• Cyclic descents and \(P\)-partitions.
• Cyclic Eulerian elements
• Cyclic sieving for longest reduced words in the hyperoctahedral group
• Cyclic sieving of increasing tableaux and small Schröder paths
• Cyclic sieving, promotion, and representation theory
• Generalized Quotients in Coxeter Groups
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• On rotated Schur-positive sets
• Promotion and cyclic sieving via webs
• Promotion and evacuation
• Resonance in orbits of plane partitions and increasing tableaux

Cited in

(11)

• Refined cyclic sieving on words for the major index statistic
• Cyclic descents for general skew tableaux
• On cyclic Schur-positive sets of permutations
• Enumeration of row-increasing tableaux of two-row skew shapes
• On cyclic descents for tableaux
• On cyclic descents for tableaux
• Cyclic descents for Motzkin paths
• Higher Lie characters and cyclic descent extension on conjugacy classes
• Cyclic descent extensions and distributions
• Eulerian-type polynomials over Stirling permutations and box sorting algorithm
• Tableau posets and the fake degrees of coinvariant algebras

This page was built for publication: Cyclic descents for near-hook and two-row shapes

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