Non-overlapping descents and ascents in stack-sortable permutations

DOI10.1016/J.DAM.2023.11.020arXiv2310.17236MaRDI QIDQ6180571FDOQ6180571

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

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

zbMATH Keywords

descentpattern-avoidanceascentstack-sortable permutation

Mathematics Subject Classification ID

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

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Partially ordered generalized patterns
• A survey of stack sortable permutations
• The descent statistic on 123-avoiding permutations
• A simple bijection between binary trees and colored ternary trees
• Distributions of statistics over pattern-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)