activity
20112021
most citedThe Maximum Likelihood Degree of Toric Varieties

38 citations · 63 across the 9 of their papers we have counts for

collaborators

9 papers

math.AC2021★ 2 cited

A hypergraph characterization of nearly complete intersections

Chiara Bondi, Courtney R. Gibbons, Yuye Ke +3

Recently, nearly complete intersection ideals were defined by Boocher and Seiner to establish lower bounds on Betti numbers for monomial ideals (arXiv:1706.09866). Stone and Miller…

math.AC2019★ 1 cited

Divisor sequences of atoms in Krull monoids

Nicholas R. Baeth, Terri Bell, Courtney R. Gibbons +1

The divisor sequence of an irreducible element (\textit{atom}) of a reduced monoid is the sequence where, for each positive integer , den…

math.CO2018

Fixing Numbers of Graphs and Groups

Courtney R. Gibbons, Joshua D. Laison

The fixing number of a graph is the smallest cardinality of a set of vertices such that only the trivial automorphism of fixes every vertex in . The fixing set of a…

math.AC2017★ 2 cited

Recursive strategy for decomposing Betti tables of complete intersections

Courtney R. Gibbons, Robert Huben, Branden Stone

We introduce a recursive decomposition algorithm for the Betti diagram of a complete intersection using the diagram of a complete intersection defined by a subset of the original g…

math.AG2017★ 38 cited

The Maximum Likelihood Degree of Toric Varieties

Carlos Améndola, Nathan Bliss, Isaac Burke +6

We study the maximum likelihood degree (ML degree) of toric varieties, known as discrete exponential models in statistics. By introducing scaling coefficients to the monomial param…

math.AC2015★ 3 cited

Rational combinations of Betti diagrams of complete intersections

Michael T. Annunziata, Courtney R. Gibbons, Cole Hawkins +1

We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-Söderberg theory. That is, given a Betti diagram, we determine if it is possible…

math.CO2015

Critical Pebbling Numbers of Graphs

Courtney R. Gibbons, Joshua D. Laison, Erick J. Paul

We define three new pebbling parameters of a connected graph , the -, -, and -critical pebbling numbers. Together with the pebbling number, the optimal pebbling number,…

math.AC2013★ 3 cited

Non-simplicial decompositions of Betti diagrams of complete intersections

Courtney Gibbons, Jack Jeffries, Sarah Mayes +3

We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij--Soederberg theory. That is, given a Betti diagram, we decompose it into pure di…

math.AC2011★ 14 cited

The cone of Betti diagrams over a hypersurface ring of low embedding dimension

Christine Berkesch, Jesse Burke, Daniel Erman +1

We give a complete description of the cone of Betti diagrams over a standard graded hypersurface ring of the form k[x,y]/<q>, where q is a homogeneous quadric. We also provide a fi…