External Columns and Chambers of Vector Partition Functions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract The vector partition function $$p_A$$ associated to a $$d \times n$$ matrix A with integer entries is the function $$\mathbb {Z}^d \rightarrow \mathbb {N}$$ defined by $$\mathbf{b} \rightarrow \#\{\mathbf{x} \in \mathbb {N}^n: A\mathbf{x} = \mathbf{b}\}$$ . 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 A . In this article we introduce external columns and external chambers of vector partition functions. Our main result is that (up to a saturation condition) the quasi-polynomial associated to a chamber containing k external columns arises from a vector partition function with k 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 quasi-polynomial arises from a coin exchange problem. By exploiting this we are able to obtain a determinantal formula, characterize when the quasi-polynomial is polynomial, and show that in this case it is actually given, up to sign, by a negative binomial coefficient. We then apply these results to the enumeration of loopless multigraphs satisfying certain degree conditions. Finally, we discuss possible generalizations of our results to some problems in combinatorics and geometry.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it