49 citations · 165 across the 22 of their papers we have counts for
24 papers
Quasipolynomial behavior via constructibility in multigraded algebra
Hailong Dao, Ezra Miller, Jonathan Montaño +2
Piecewise quasipolynomial growth of Presburger counting functions combines with tame persistent homology module theory to conclude piecewise quasipolynomial behavior of constructib…
Counting with two-level polynomials
Tristram Bogart, Kevin Woods
We examine combinatorial counting functions with two parameters, and . For fixed , these functions are (quasi-)polynomial in . As varies, the degree of this polyno…
Numerical semigroups via projections and via quotients
Tristram Bogart, Christopher O'Neill, Kevin Woods
We examine two natural operations to create numerical semigroups. We say that a numerical semigroup is -normalescent if it is the projection of the set of integer…
When is a numerical semigroup a quotient?
Tristram Bogart, Christopher O'Neill, Kevin Woods
A natural operation on numerical semigroups is taking a quotient by a positive integer. If is a quotient of a numerical semigroup with generators, we call $\mathca…
A Plethora of Polynomials: A Toolbox for Counting Problems
Tristram Bogart, Kevin Woods
A wide variety of problems in combinatorics and discrete optimization depend on counting the set of integer points in a polytope, or in some more general object constructed via…
The generalized Frobenius problem via restricted partition functions
Kevin Woods
Given relatively prime positive integers, , the Frobenius number is the largest integer with no representations of the form with nonnegative…