Pin classes. II: Small pin classes

DOI10.46298/DMTCS.14896MaRDI QIDQ7251157zbMATH OpenFDO

Authors Robert Brignall, Ben Jarvis

Publication date 22 May 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.14896

zbMATH Keywords

generating functiongrowth ratepermutation classespin permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Cites work

• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Analytic combinatorics
• Combinatorial problems of commutation and rearrangements
• Decomposing simple permutations, with enumerative consequences
• Enumeration of pin-permutations
• Factor complexity
• Growth rates of geometric grid classes of permutations
• Growth rates of permutation classes: categorization up to the uncountability threshold
• Growth rates of permutation classes: from countable to uncountable
• Handbook of Enumerative Combinatorics
• Intervals of permutation class growth rates
• On growth rates of closed permutation classes
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
• Simple permutations: Decidability and unavoidable substructures
• Small permutation classes
• Substitutions in dynamics, arithmetics and combinatorics
• Symbolic dynamics.
• The X-class and almost-increasing permutations
• Unavoidable induced subgraphs in large graphs with no homogeneous sets

This page was built for publication: Pin classes. II: Small pin classes

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