External columns and chambers of vector partition functions
Stefan Trandafir

TL;DR
This paper introduces external columns and chambers in vector partition functions, linking certain chambers to coin exchange problems and deriving formulas and conditions for polynomiality, with applications to graph enumeration.
Contribution
It defines external chambers and shows their associated quasi-polynomials relate to lower-dimensional vector partition functions, including a determinantal formula and polynomiality criteria.
Findings
External chambers correspond to coin exchange problems.
Quasi-polynomials in external chambers are given by negative binomial coefficients.
Results apply to enumerating loopless multigraphs with degree constraints.
Abstract
The vector partition function associated to a matrix with integer entries is the function defined by . It is known that vector partition functions are piecewise quasi-polynomials whose domains of quasi-polynomiality are maximal cones (chambers) of a fan called the chamber complex of . In this article we introduce \emph{external columns} and \emph{external chambers} of vector partition functions. Our main result is that (up to a saturation condition) the quasi-polynomial associated to a chamber containing external columns arises from a vector partition function with fewer equations and variables. In the case that the chamber is external -- that is, when the number of external columns in a chamber is as large as possible without being trivial -- the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · Mathematical functions and polynomials
