Piecewise Quasipolynomial Growth

• Piecewise quasipolynomial growth is a framework where integer counting functions are defined by quasi-polynomials on distinct polyhedral chambers.
• It plays a key role in Ehrhart theory, Presburger arithmetic, and algebraic geometry by linking geometric structures with periodic lattice behavior.
• Methods combining polyhedral decomposition and lattice enumeration reveal abrupt wall-crossings and periodic refinements in counting discrete objects.

Piecewise quasipolynomial growth is a phenomenon where counting functions—arising in combinatorics, algebraic geometry, commutative algebra, and related disciplines—are governed by different quasi-polynomials on a finite collection of polyhedral regions (“chambers”) in parameter space. These functions generalize classical polynomial and quasi-polynomial behavior by incorporating both polyhedral subdivision and periodic, lattice-based structure, leading to highly structured, chamberwise-quasipolynomial formulas governing counts of objects parameterized by several discrete variables.

1. Formal Definitions and Basic Framework

A function $g: \mathbb{Z}^k \to \mathbb{Q}$ is called piecewise quasipolynomial if there exists a finite polyhedral subdivision of $\mathbb{R}^k$ into rational convex polyhedra (cells) $\Gamma_\alpha$, each equipped with a quasi-polynomial $P_\alpha(n)$ and a finite-index sublattice $\Lambda$, such that for $n \in \Gamma_\alpha \cap \mathbb{Z}^k$ and $n \equiv m \pmod{\Lambda}$,

$g(n) = P_\alpha(n).$

In this sense, $g$ exhibits a partitioned periodic-polynomial behavior, with both the polynomial part and the period structure depending on the chamber. Chambers (or cells) are defined by the arrangement of affine rational hyperplanes in the parameter space; crossing a chamber wall can change the quasi-polynomial data describing $g$ (Dao et al., 20 Dec 2025).

A univariate quasi-polynomial $g: \mathbb{N} \to \mathbb{Q}$ is given by a period $m$ and polynomials $\{p_0, \ldots, p_{m-1}\}$ such that $g(t) = p_i(t)$ when $t \equiv i \pmod m$. In higher rank, periods correspond to cosets of a finite-index sublattice (Woods, 2013).

2. Prototypical Occurrences: Ehrhart Theory and Polyhedral Counting Functions

The classical emergence of (piecewise) quasipolynomiality is found in Ehrhart theory: the function $t \mapsto |tP \cap \mathbb{Z}^d|$ for a rational polytope $P \subset \mathbb{R}^d$ is a quasi-polynomial in $t$, with its period determined by the denominators of $P$’s vertices (Woods, 2013).

In parametric settings or higher-dimensional families, one considers polytopes $$P(b) = \{x \in V : \langle \alpha_j, x \rangle \leq b_j\}$$ with $b = (b_j) \in \mathbb{R}^N$. As the multi-parameter $b$ varies, the combinatorial type of $P(b)$ changes precisely when one crosses “walls”—hyperplanes delineating a finite polyhedral chamber decomposition. On each chamber, the integer-point counting function

$S^{\{0\}}(P(b), 1) = |P(b) \cap \Lambda|$

is given by a quasi-polynomial in $b$ (Baldoni et al., 2014). The construction extends to parametric weighted sums, intermediate sums, and generating functions.

Similarly, in Presburger arithmetic, any counting function of the form $n \mapsto |\{x \in \mathbb{Z}^d : F(n, x)\}|$, with $F$ a first-order formula over $(\mathbb{Z},+)$, is piecewise quasipolynomial in $n$, with polynomial degree at most $d$ (Dao et al., 20 Dec 2025).

3. Structural Results and Theorems

Several key theorems provide the rigorous underpinning for piecewise quasipolynomiality:

• Chamberwise Quasipolynomiality: For parametric polytopes $P(b)$, on each chamber $\tau$ in the parameter space, the counting function (and generalizations thereof, such as weighted intermediate sums $S^L(P(b), h)$) is a quasi-polynomial of bounded degree in $b$ (Baldoni et al., 2014). In other words, the wall-crossing structure is polyhedral, and each chamber is governed by explicit quasi-polynomial data.
• Functorial Constructibility: In multigraded (e.g., Rees-monoid) algebra, constructible families of modules have the property that homological functors (local cohomology, $\operatorname{Tor}$, $\operatorname{Ext}$) preserve constructibility, thereby inducing piecewise quasipolynomial (or, for certain invariants like regularity, quasilinear) formulas for a range of numerical invariants, including length, Betti numbers, Hilbert coefficients, and extended degrees (Dao et al., 20 Dec 2025).
• Enumerative Geometry: In the context of tropical geometry, functions counting double tropical Welschinger invariants (counts of real tropical curves with prescribed combinatorial and geometric data) are shown to be piecewise quasipolynomial in collections of discrete boundary parameters, with the chamber structure defined by explicit rational hyperplane arrangements (Reda, 5 Nov 2025).
• Parametric Presburger Families: Every parametric Presburger-definable family $S_t \subset \mathbb{N}^d$ (allowing quantification and Boolean combinations of linear inequalities with parameter-dependent coefficients) has the property that the counting function $|S_t|$ is eventually (piecewise) quasipolynomial for large $t$ (Woods, 2013).

4. Methods of Proof and Polyhedral-Geometric Mechanisms

Proofs of piecewise quasipolynomiality combine techniques from polyhedral combinatorics, lattice point enumeration, and algebraic geometry:

• Brion’s Theorem and Decomposition: The indicator function of a polytope is decomposed into supporting tangent cones at its vertices, allowing the integer-point counting to be reduced to summations over these cones, each contributing quasipolynomial pieces (Baldoni et al., 2014).
• Weight Lifting and Ehrhart Theory: In the presence of weighted counts (e.g., in tropical enumerative geometry), multiplicities are themselves quasipolynomial in the relevant parameters, frequently via parity indicators or products of variables, and can be encoded through the enumeration of lattice points in higher-dimensional polytopes (Reda, 5 Nov 2025).
• Chamber Decomposition via Hyperplane Arrangements: The explicit walls in the parameter space are given by families of rational affine hyperplanes, each associated with a change in the combinatorial or algebraic type of the objects being counted. The chamber-based structure is fundamentally polyhedral, and partitioning parameter space is algorithmic in principle (Baldoni et al., 2014, Reda, 5 Nov 2025).
• Tools from Algebraic Combinatorics: Techniques such as Smith/Hermite normal form for parameter-dependent matrices, division and Euclidean algorithm for polynomials over $\mathbb{Z}[t]$, and rational generating function constructions are essential for both structure theorems and explicit computation (Woods, 2013).

5. Central Examples

Piecewise quasipolynomial growth is manifest across multiple representative instances:

Example Type	Parameter Space	Chamber Structure
Ehrhart counting (# $(tP) \cap \mathbb{Z}^d$)	$t \in \mathbb{N}$	Periodic (quasi-polynomial)
Parametric polytope families	$(t_1, \ldots, t_k) \in \mathbb{N}^k$	Polyhedral chambers
Presburger-definable families	$t \in \mathbb{N}^k$	Polyhedral chambers, cosets
Welschinger-type tropical counts	$(x, y, …) \in \mathbb{Z}^n$	Chambers via divergence and order hyperplanes

Each instance involves a subdivision of parameter space, explicit polynomial and periodic data on each piece, and abrupt changes (“wall-crossing”) when passing between chambers.

For example, in combinatorial Welschinger counts on h-transverse polygons, on each chamber defined by divergence and coincidence hyperplanes, the count is a quasi-polynomial of period at most 2 and degree equal to the genus $g$ (Reda, 5 Nov 2025). In multigraded algebra, Betti numbers and related invariants for families of monomial ideals or Rees modules are given by piecewise quasipolynomial or quasilinear formulas, with polyhedral and congruence refinements of parameter space (Dao et al., 20 Dec 2025). Classical Sylvester/Frobenius numbers, symbolic power growth, and integer hulls of polytope families likewise exhibit piecewise quasipolynomial structure (Woods, 2013).

6. Applications and Contexts

Piecewise quasipolynomial growth plays a central role in:

• Enumerative Algebraic Geometry: Counts of curves, intersection numbers, and real enumerative invariants on toric/tropical varieties are governed by piecewise quasipolynomial functions in discrete deformation parameters (Reda, 5 Nov 2025).
• Commutative Algebra and Module Theory: Asymptotics of module invariants such as Betti numbers, $a$-invariants, regularity, Hilbert coefficients, arithmetic/homological degrees for families parameterized by degrees or symbolic powers are described exactly by piecewise quasipolynomial formulas (Dao et al., 20 Dec 2025).
• Combinatorial Optimization and Integer Programming: Parametric ILPs and knapsack-type problems have counting functions or optimal values that are piecewise quasipolynomial, given the dependence of feasible region structure on parameters (Woods, 2013).
• Lattice Point Enumeration and Generating Functions: Rational polyhedron counting, generating functions associated with parametric integer point enumeration, and their structure under Chamber decomposition is governed by piecewise quasipolynomiality (Baldoni et al., 2014).

7. Limitations and Open Directions

Several boundaries and open questions attend the theory:

• For families defined by more general (e.g., non-linear) parameterizations, only partial results are available (e.g., for the parametric Frobenius problem with non-linear generators, general quasi-polynomiality is not proven) (Woods, 2013).
• Explicit determination of periods and cell boundaries can be algorithmically and computationally intensive, with periods often growing double-exponentially with parameter size.
• In situations where parameter-dependent constraints yield unbounded feasible regions in some cells, only local (piecewise) quasi-polynomiality appears; there is no global quasi-polynomiality across the entire parameter space.
• While all Presburger-definable families admit piecewise quasipolynomial counting, rationality properties of associated generating functions may fail in higher-rank parameter families with non-linear dependencies (Woods, 2013).

Piecewise quasipolynomial growth thus encapsulates a highly structured, polyhedral, and periodic framework for the asymptotic and exact enumeration in discrete, algebraic, and geometric settings, unifying and extending polynomial and quasi-polynomial phenomena across a remarkable spectrum of mathematical disciplines.