An Algorithm to Enumerate Grid Signed Permutation Classes

DOI10.1145/3597066.3597088arXiv2302.03929OpenAlexW4379261363WikidataQ130913691 ScholiaQ130913691MaRDI QIDQ6060350

Saúl A. Blanco, Unnamed Author

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

permutation classprefix reversalpolynomial enumeration

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Excluded permutation matrices and the Stanley-Wilf conjecture
• An \((18/11)n\) upper bound for sorting by prefix reversals
• Bounds for sorting by prefix reversal
• On growth rates of closed permutation classes
• On the problem of sorting burnt pancakes
• Cycles in the burnt pancake graph
• Permutation classes of polynomial growth
• Grid classes and the Fibonacci dichotomy for restricted permutations
• Permutation classes
• Transforming cabbage into turnip
• On the number of pancake stacks requiring four flips to be sorted
• On the effective and automatic enumeration of polynomial permutation classes

This page was built for publication: An Algorithm to Enumerate Grid Signed Permutation Classes