4 papers
Eventually nondecreasing quasi-polynomials
Benjamin Braun, Christopher O'Neill, Antwon Park
Quasi-polynomials are ubiquitous in combinatorics and algebra, as they arise in a variety of enumeration problems. Because quasi-polynomials consist of constituent polynomials, the…
Lengths of irreducible decompositions of numerical semigroups
Pedro Garcia-Sanchez, Christopher O'Neill
A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written…
Quasipolynomial behavior via constructibility in multigraded algebra
Hailong Dao, Ezra Miller, Jonathan Montaño +2
Piecewise quasipolynomial growth of Presburger counting functions combines with tame persistent homology module theory to conclude piecewise quasipolynomial behavior of constructib…
Numerical semigroups, polyhedra, and posets IV: walking the faces of the Kunz cone
Cole Brower, Joseph McDonough, Christopher O'Neill
A numerical semigroup is a cofinite subset of containing and closed under addition. Each numerical semigroup with smallest positive element correspo…