Cyclic descents for general skew tableaux

DOI10.1016/J.JCTA.2019.105120zbMATH Open1428.05317arXiv1808.04918OpenAlexW2885174367MaRDI QIDQ2010616FDOQ2010616

Authors: Brice Huang 

Publication date: 27 November 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: A cyclic descent function on standard Young tableaux of size $n$ is a function that restricts to the usual descent function when $n$ is omitted, such that the number of standard Young tableaux of given shape with cyclic descent set $Dsubset[n]$ is invariant under any modulo $n$ shift of $D$. The notion of cyclic descent was first studied for rectangles by Rhoades, and then generalized to certain families of skew shapes by Adin, Elizalde, and Roichman. Adin, Reiner, and Roichman proved that a skew shape has a cyclic descent map if and only if it is not a connected ribbon. Unfortunately, their proof is nonconstructive; until now, explicit cyclic descent maps are known only for small families of shapes. In this paper, we construct an explicit cyclic descent map for all shapes where this is possible. We thus provide a constructive proof of Adin, Reiner, and Roichman's result. Our construction of a cyclic descent map generalizes many of the constructions in the literature.

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

Recommendations

• Cyclic descents for near-hook and two-row shapes
• Cyclic descents for Motzkin paths
• On cyclic descents for tableaux
• On cyclic descents for tableaux
• Promotion and cyclic sieving on families of SSYT

zbMATH Keywords

descentstandard Young tableauxcyclic descent

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The cyclic sieving phenomenon
• Promotion and evacuation
• Affine approach to quantum Schubert calculus
• Cyclic sieving of increasing tableaux and small Schröder paths
• Cyclic sieving, promotion, and representation theory
• Cyclic descents and \(P\)-partitions.
• Promotion and cyclic sieving via webs
• On rotated Schur-positive sets
• Cyclic sieving, rotation, and geometric representation theory
• Cyclic Eulerian elements
• Cyclic descents for near-hook and two-row shapes

Cited In (11)

• Promotion sorting
• Refined Catalan and Narayana cyclic sieving
• Cyclic descents for Motzkin paths
• Higher Lie characters and cyclic descent extension on conjugacy classes
• Permutoric promotion: gliding globs, sliding stones, and colliding coins
• Cyclic descents, matchings and Schur-positivity
• Toric promotion
• Cyclic quasi-symmetric functions
• On cyclic Schur-positive sets of permutations
• On cyclic descents for tableaux
• Higher Lie characters and cyclic descent extension on conjugacy classes

This page was built for publication: Cyclic descents for general skew tableaux

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