13 citations · 13 across the 3 of their papers we have counts for
3 papers
math.CO2026
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…
math.CO2026
Ehrhart -distributions
Benjamin Braun, Max Hlavacek, Cesar J. Meza +2
Every polynomial with real non-negative coefficients yields a finite probability distribution after normalization. The Ehrhart -polynomial of a lattice polytope is a non-n…
math.CO2026★ 13 cited
Counting Arithmetical Structures on Paths and Cycles
Benjamin Braun, Hugo Corrales, Scott Corry +6
Let be a finite, simple, connected graph. An arithmetical structure on is a pair of positive integer vectors such that $(\mathrm{diag}(\mathbf{d})-A…