2 citations · 3 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
Numerical semigroups from rational matrices II: matricial dimension does not exceed multiplicity
Arsh Chhabra, Stephan Ramon Garcia, Christopher O'Neill
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least g…
Counting edges in factorization graphs of numerical semigroup elements
Mariah Moschetti, Christopher O'Neill
A numerical semigroup is an additively-closed set of non-negative integers, and a factorization of an element of is an expression of as a sum of generators of .…
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…
On faces of the Kunz cone and the numerical semigroups within them
Levi Borevitz, Tara Gomes, Jiajie Ma +6
A numerical semigroup is a cofinite subset of the non-negative integers that is closed under addition and contains 0. Each numerical semigroup with fixed smallest positive elem…