Finiteness theorems for Cayley permutation classes
Giulio Cerbai, Anders Claesson
Source abstract
We prove that every hereditary Cayley permutation class with finitely many simple members has a finite basis and an algebraic generating function. We first show that every simple Cayley permutation of length at least two contains a simple pattern obtained by deleting one or two letters, and that the only exceptional Cayley permutations are the simple parallel alternations and their symmetries. We then characterize substitution-closed classes by the simplicity of their basis elements and show that classes with finitely many simple members are partially well ordered. Given the simple members and the basis of such a class, we construct a finite system of functional equations and compute an annihilating polynomial.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.