不可数多个well-quasi-ordered排列类的枚举
Uncountably many enumerations of well-quasi-ordered permutation classes
中文总结 AI 辅助
本文构造了不可数多个well-quasi-ordered排列类，每个类有独特的枚举序列，推翻了所有well-quasi-ordered排列类具有代数生成函数的猜想，证明许多此类类缺乏D-有限或D-代数生成函数。
中文摘要 AI 辅助
我们构造了一个不可数族的well-quasi-ordered排列类，每个类都有一个不同的枚举序列。这推翻了一个猜想，即所有well-quasi-ordered排列类都有代数生成函数，事实上证明了许多此类类缺乏D-有限或D-代数生成函数。我们的构造基于Pouzet提出的不可数大的因子封闭、well-quasi-ordered二进制语言集合。
英文摘要
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in fact shows that many such classes lack D-finite or D-algebraic generating functions. Our construction is based on an uncountably large collection of factor-closed, well-quasi-ordered binary languages due to Pouzet.
