Uncountably many enumerations of well-quasi-ordered permutation classes
From MaRDI portal
Publication:6418142
Abstract: We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a widely-held conjecture that all well-quasi-ordered permutation classes have algebraic generating functions. The construction uses an uncountably large collection of factor-closed binary languages to exhibit an uncountably large collection of infinite binary sequences, each with distinct linear complexity functions.
This page was built for publication: Uncountably many enumerations of well-quasi-ordered permutation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418142)
