Non-overlapping descents and ascents in stack-sortable permutations

DOI10.1016/J.DAM.2023.11.020MaRDI QIDQ6180571zbMATH OpenFDO

Authors Sergey Kitaev, Philip B. Zhang

Publication date 22 December 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

descentpattern-avoidanceascentstack-sortable permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Multi-static enumeration of two-stack sortable permutations
• Stack-sortable permutations and beyond
• Asymptotic normality in \(t\)-stack sortable permutations
• Descents in \(t\)-sorted permutations
• On the real-rootedness of the descent polynomials of (n-2)-stack sortable permutations

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A simple bijection between binary trees and colored ternary trees
• A survey of stack sortable permutations
• Distributions of statistics over pattern-avoiding permutations
• Partially ordered generalized patterns
• The On-Line Encyclopedia of Integer Sequences
• The descent statistic on 123-avoiding permutations

This page was built for publication: Non-overlapping descents and ascents in stack-sortable permutations

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