Constructs an uncountable family of well-quasi-ordered permutation classes with pairwise distinct enumeration sequences, disproving the conjecture that all such classes have algebraic generating functions.
Problems and Conjectures presented at the Third International Conference on Permutation Patterns, University of Florida, March 7-11
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We recount problems, questions and conjectures that arose during a problem session of the Third International Conference on Permutation Patterns, University of Florida, March 7-11, 2005.
fields
math.CO 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Uncountably many enumerations of well-quasi-ordered permutation classes
Constructs an uncountable family of well-quasi-ordered permutation classes with pairwise distinct enumeration sequences, disproving the conjecture that all such classes have algebraic generating functions.