On the least exponential growth admitting uncountably many closed permutation classes

Authors:
Martin Klazar
Affiliations:
Department of Applied Mathematics (KAM) and Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00 Praha, Czech Republic
Venue:
Theoretical Computer Science
Year:
2004

Citing 8
Cited 0

Enumerative combinatorics

Enumerative combinatorics
Generating trees and forbidden subsequences

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Pattern matching for permutations

Information Processing Letters
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Sorting with two ordered stacks in series

Theoretical Computer Science
Computing permutations with double-ended queues, parallel stacks and parallel queues

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Regular closed sets of permutations

Theoretical Computer Science
Generalized Stack Permutations

Combinatorics, Probability and Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2n and (2.33529...)n.