14 citations · 59 across the 29 of their papers we have counts for
37 papers · 1 filter
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…
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…
Ehrhart Limits
Benjamin Braun, McCabe Olsen
We introduce the definition of an Ehrhart limit, that is, a formal power series with integer coefficients that is the limit in the ring of formal power series of a sequence of Ehrh…
Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering
Benjamin Braun, Kaitlin Bruegge, Matthew Kahle
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symm…
Triangulations of Flow Polytopes, Ample Framings, and Gentle Algebras
Matias von Bell, Benjamin Braun, Kaitlin Bruegge +4
The cone of nonnegative flows for a directed acyclic graph (DAG) is known to admit regular unimodular triangulations induced by framings of the DAG. These triangulations restrict t…
Facets of Symmetric Edge Polytopes for Graphs with Few Edges
Benjamin Braun, Kaitlin Bruegge
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) givin…