Characteristic quasi-polynomials of truncated arrangements
Ying Cao, Houshan Fu

TL;DR
This paper investigates the combinatorial properties of truncated arrangements' characteristic quasi-polynomials, providing explicit counting formulas, generalizing previous results, and exploring applications in group colorings and flow enumeration.
Contribution
It derives a new explicit counting formula for arrangement complements, generalizes existing conditions, and introduces the concept of combinatorial equivalence for quasi-polynomials.
Findings
Cardinality of arrangement complements expressed via quasi-polynomials
Generalized divisibility conditions for coefficients comparison
Revisited group coloring and flow enumeration using new methods
Abstract
Given an (affine) integral arrangement in , the reduction of modulo an arbitrary positive integer naturally yields an arrangement in . Our primary objective is to study the combinatorial aspects of the restriction to the solution space of , and its reduction modulo . This work generalizes the earlier results of Kamiya, Takemura and Terao, as well as Chen and Wang. The purpose of this paper is threefold as follows. Firstly, we derive an explicit counting formula for the cardinality of the complement of ; and prove that for all positive integers , this cardinality coincides with a quasi-polynomial in with a…
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 · Polynomial and algebraic computation · Advanced Mathematical Identities
