Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture

zbMath1300.05007arXiv1404.1457MaRDI QIDQ405184

Mark Dukes

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

descent polynomialrevstackstack sort

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (5)

Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ The pop-stack-sorting operator on Tamari lattices ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Fertility monotonicity and average complexity of the stack-sorting map

Cites Work

• Unnamed Item
• Unnamed Item
• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
• Permutations sortable by \(n - 4\) passes through a stack
• Descent polynomials for permutations with bounded drop size
• Describing West-3-stack-sortable permutations with permutation patterns
• Combinatorial statistics on non-crossing partitions
• A combinatorial proof of J. West's conjecture
• Symmetry and unimodality in \(t\)-stack sortable permutations

This page was built for publication: Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture