Christopher O'Neill
Christopher O'Neill has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Roberto Pelayo
University of Hawai‘i at Hilo
4 shared publications Samuel Yih
Research Initiation
2 shared publicationsBrandon Van Over
University of California Berkeley
1 shared publication- Brandon Van Over1 shared publication
- Daniel Irving Bernstein
Department of Mathematics, Tulane University, New Orleans, LA 70118 USA
1 shared publication - David Kahle
Baylor University
1 shared publication
Latest Publications
- Open Access
Factorization length distribution for affine semigroups I: numerical semigroups with three generators
Most factorization invariants in the literature extract extremal factorization behavior, such as the maximum and minimum factorization lengths. Invariants of intermediate size, such as the mean, median, and mode factorization lengths are more subtle. We use techniques from analysis and probability to describe the asymptotic behavior of these invariants. Surprisingly, the asymptotic median factorization length is described by a number that is usually irrational.
Open AccessFactorization length distribution for affine semigroups I: numerical semigroups with three generators
Most factorization invariants in the literature extract extremal factorization behavior, such as the maximum and minimum factorization lengths. Invariants of intermediate size, such as the mean, median, and mode factorization lengths are more subtle. We use techniques from analysis and probability to describe the asymptotic behavior of these invariants. Surprisingly, the asymptotic median factorization length is described by a number that is usually irrational.
- 16 July 2018
- Published by Springer Nature in Semigroup Forum
- Vol. 98 (2) , 315-326
On arithmetical numerical monoids with some generators omitted
- 16 July 2018
- Published by Springer Nature in Semigroup Forum
- Vol. 98 (2) , 315-326
On arithmetical numerical monoids with some generators omitted
- Open Access
Factoring in the Chicken McNugget monoid
Every day, 34 million Chicken McNuggets are sold worldwide. At most McDonalds locations in the United States today, Chicken McNuggets are sold in packs of 4, 6, 10, 20, 40, and 50 pieces. However, shortly after their introduction in 1979 they were sold in packs of 6, 9, and 20. The use of these latter three numbers spawned the so-called Chicken McNugget problem, which asks: "what numbers of Chicken McNuggets can be ordered using only packs with 6, 9, or 20 pieces?" In this paper, we present an accessible introduction to this problem, as well as several related questions whose motivation comes from the theory of non-unique factorization.
Open AccessFactoring in the Chicken McNugget monoid
Every day, 34 million Chicken McNuggets are sold worldwide. At most McDonalds locations in the United States today, Chicken McNuggets are sold in packs of 4, 6, 10, 20, 40, and 50 pieces. However, shortly after their introduction in 1979 they were sold in packs of 6, 9, and 20. The use of these latter three numbers spawned the so-called Chicken McNugget problem, which asks: "what numbers of Chicken McNuggets can be ordered using only packs with 6, 9, or 20 pieces?" In this paper, we present an accessible introduction to this problem, as well as several related questions whose motivation comes from the theory of non-unique factorization.
- Open Access
Squarefree divisor complexes of certain numerical semigroup elements
A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded Betti numbers. We compute squarefree divisor complexes for certain classes numerical semigroups, and exhibit a new family of simplicial complexes that are occur as the squarefree divisor complex of some numerical semigroup element.Open AccessSquarefree divisor complexes of certain numerical semigroup elements
A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded Betti numbers. We compute squarefree divisor complexes for certain classes numerical semigroups, and exhibit a new family of simplicial complexes that are occur as the squarefree divisor complex of some numerical semigroup element. - Open Access
Apéry sets of shifted numerical monoids
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we characterize the Ap\'ery set of $M_n$ in terms of the Ap\'ery set of the base monoid $S$ when $n$ is sufficiently large. We give a highly efficient algorithm for computing the Ap\'ery set of $M_n$ in this case, and prove that several numerical monoid invariants, such as the genus and Frobenius number, are eventually quasipolynomial as a function of $n$.Open AccessApéry sets of shifted numerical monoids
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we characterize the Ap\'ery set of $M_n$ in terms of the Ap\'ery set of the base monoid $S$ when $n$ is sufficiently large. We give a highly efficient algorithm for computing the Ap\'ery set of $M_n$ in this case, and prove that several numerical monoid invariants, such as the genus and Frobenius number, are eventually quasipolynomial as a function of $n$. - Open Access
Some algebraic aspects of mesoprimary decomposition
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. Monoid congruences (and therefore, binomial ideals) can present many subtle behaviors that must be carefully accounted for in order to produce general results, and this makes the theory complicated. In this paper, we examine their results in the presence of a positive $A$-grading, where certain pathologies are avoided and the theory becomes more accessible. Our approach is algebraic: while key notions for mesoprimary decomposition are developed first from a combinatorial point of view, here we state definitions and results in algebraic terms, which are moreover significantly simplified due to our (slightly) restricted setting. In the case of toral components (which are well-behaved with respect to the $A$-grading), we are able to obtain further simplifications under additional assumptions. We also provide counterexamples to two open questions, identifying (i) a binomial ideal whose hull is not binomial, answering a question of Eisenbud and Sturmfels, and (ii) a binomial ideal $I$ for which $I_\text{toral}$ is not binomial, answering a question of Dickenstein, Miller and the first author.Open AccessSome algebraic aspects of mesoprimary decomposition
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. Monoid congruences (and therefore, binomial ideals) can present many subtle behaviors that must be carefully accounted for in order to produce general results, and this makes the theory complicated. In this paper, we examine their results in the presence of a positive $A$-grading, where certain pathologies are avoided and the theory becomes more accessible. Our approach is algebraic: while key notions for mesoprimary decomposition are developed first from a combinatorial point of view, here we state definitions and results in algebraic terms, which are moreover significantly simplified due to our (slightly) restricted setting. In the case of toral components (which are well-behaved with respect to the $A$-grading), we are able to obtain further simplifications under additional assumptions. We also provide counterexamples to two open questions, identifying (i) a binomial ideal whose hull is not binomial, answering a question of Eisenbud and Sturmfels, and (ii) a binomial ideal $I$ for which $I_\text{toral}$ is not binomial, answering a question of Dickenstein, Miller and the first author. - Open Access
On arithmetical numerical monoids with some generators omitted
Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are minimally generated by arithmetic sequences, are particularly well-behaved, admitting closed forms for many invariants that are difficult to compute in the general case. In~this paper, we answer the question "when does omitting generators from an arithmetical numerical monoid $S$ preserve its (well-understood) set of length sets and/or Frobenius number?" in two extremal cases: (i) we characterize which individual generators can be omitted from $S$ without changing the set of length sets or Frobenius number; and (ii) we prove that under certain conditions, nearly every generator of $S$ can be omitted without changing its set of length sets or Frobenius number.Open AccessOn arithmetical numerical monoids with some generators omitted
Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are minimally generated by arithmetic sequences, are particularly well-behaved, admitting closed forms for many invariants that are difficult to compute in the general case. In~this paper, we answer the question "when does omitting generators from an arithmetical numerical monoid $S$ preserve its (well-understood) set of length sets and/or Frobenius number?" in two extremal cases: (i) we characterize which individual generators can be omitted from $S$ without changing the set of length sets or Frobenius number; and (ii) we prove that under certain conditions, nearly every generator of $S$ can be omitted without changing its set of length sets or Frobenius number. - Open Access
- 4 December 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 97 (2) , 240-245
REALISABLE SETS OF CATENARY DEGREES OF NUMERICAL MONOIDS
The catenary degree is an invariant that measures the distance between factorisations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb{Z}_{\geq 0}$ occur as the set of catenary degrees of a numerical monoid (that is, a co-finite, additive submonoid of $\mathbb{Z}_{\geq 0}$ ). In particular, we show that, with one exception, every finite subset of $\mathbb{Z}_{\geq 0}$ that can possibly occur as the set of catenary degrees of some atomic monoid is actually achieved by a numerical monoid.- 4 December 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 97 (2) , 240-245
Open AccessREALISABLE SETS OF CATENARY DEGREES OF NUMERICAL MONOIDS
The catenary degree is an invariant that measures the distance between factorisations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb{Z}_{\geq 0}$ occur as the set of catenary degrees of a numerical monoid (that is, a co-finite, additive submonoid of $\mathbb{Z}_{\geq 0}$ ). In particular, we show that, with one exception, every finite subset of $\mathbb{Z}_{\geq 0}$ that can possibly occur as the set of catenary degrees of some atomic monoid is actually achieved by a numerical monoid. - Open Access
Unimodular hierarchical models and their Graver bases
Given a simplicial complex whose vertices are labeled with positive integers, one can associate a vector configuration whose corresponding toric variety is the Zariski closure of a hierarchical model. We classify all the vertex-weighted simplicial complexes that give rise to unimodular vector configurations. We also provide a combinatorial characterization of their Graver bases.
Open AccessUnimodular hierarchical models and their Graver bases
Given a simplicial complex whose vertices are labeled with positive integers, one can associate a vector configuration whose corresponding toric variety is the Zariski closure of a hierarchical model. We classify all the vertex-weighted simplicial complexes that give rise to unimodular vector configurations. We also provide a combinatorial characterization of their Graver bases.
- Open Access
On mesoprimary decomposition of monoid congruences
We prove two main results concerning mesoprimary decomposition of monoid congruences, as introduced by Kahle and Miller. First, we identify which associated prime congruences appear in every mesoprimary decomposition, thereby completing the theory of mesoprimary decomposition of monoid congruences as a more faithful analog of primary decomposition. Second, we answer a question posed by Kahle and Miller by characterizing which finite posets arise as the set of associated prime congruences of monoid congruences.
Open AccessOn mesoprimary decomposition of monoid congruences
We prove two main results concerning mesoprimary decomposition of monoid congruences, as introduced by Kahle and Miller. First, we identify which associated prime congruences appear in every mesoprimary decomposition, thereby completing the theory of mesoprimary decomposition of monoid congruences as a more faithful analog of primary decomposition. Second, we answer a question posed by Kahle and Miller by characterizing which finite posets arise as the set of associated prime congruences of monoid congruences.