34 citations · 239 across the 41 of their papers we have counts for
7 papers · 1 filter
Mesoprimary decomposition of binomial submodules
Christopher O'Neill
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their un…
Factorization invariants in numerical monoids
Christopher O'Neill, Roberto Pelayo
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization struc…
On dynamic algorithms for factorization invariants in numerical monoids
Thomas Barron, Christopher O'Neill, Roberto Pelayo
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and -primality. Whi…
On the set of catenary degrees of finitely generated cancellative commutative monoids
Christopher O'Neill, Vadim Ponomarenko, Reuben Tate +1
The catenary degree of an element of a cancellative commutative monoid is a nonnegative integer measuring the distance between the irreducible factorizations of . The ca…
On the computation of factorization invariants for affine semigroups
Pedro A. García-Sánchez, Christopher O'Neill, Gautam Webb
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set…
On factorization invariants and Hilbert functions
Christopher O'Neill
Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity dete…
Numerical semigroups on compound sequences
Claire Kiers, Christopher O'Neill, Vadim Ponomarenko
We generalize the geometric sequence to allow the copies of (resp. ) to all be different. We call the sequence $\{a_1a_2a_3\cdots…