2 citations · 3 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
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…
math.AC2026
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…