Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic
Abstract
Let f1(n), …, fk(n) be polynomial functions of n. For fixed n∈N, let Sn⊂eq N be the numerical semigroup generated by f1(n),…,fk(n). As n varies, we show that many invariants of Sn are eventually quasi-polynomial in n, such as the Frobenius number, the type, the genus, and the size of the -set. The tool we use is expressibility in the logical system of parametric Presburger arithmetic. Generalizing to higher dimensional families of semigroups, we also examine affine semigroups Sn⊂eq Nm generated be vectors whose coordinates are polynomial functions of n, and we prove similar results; for example, the Betti numbers are eventually quasi-polynomial functions of n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.