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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.