Quasi-polynomial

From HandWiki

In mathematics, a quasi-polynomial (sometimes called pseudo-polynomial) is a generalization of polynomials. While the coefficients of a polynomial come from a ring, the coefficients of quasi-polynomials are instead periodic functions with integral period. Quasi-polynomials appear throughout much of combinatorics as the enumerators for various objects.

Definition

A quasi-polynomial is a function q defined on of the form q(n)=cd(n)nd+cd1(n)nd1++c0(n), where each ci(n) is a periodic function with integral period. If cd(n) is not identically zero, then the degree of q is d, and any common period of c0(n),c1(n),,cd(n) is a period of q. The minimal such period (sometimes simply called the period or the quasi-period of q) is the least common multiple of the periods of c0(n),c1(n),,cd(n).

Equivalently, a function q defined on is a quasi-polynomial if there exist a positive integer s and polynomials p0,,ps1 such that q(n)=pi(n) when inmods. The minimal such s coincides with the minimal period of q. The polynomials pi are called the constituents of q.

Generating functions

A function q defined on is a quasi-polynomial of degree d and period dividing r if and only its generating function

Q(x):=n0q(n)xn

evaluates to a rational function of the form Q(x)=h(x)(1xr)d+1 where h(x) is a polynomial of degree <r(d+1).[1][2] Thus quasi-polynomials are characterized through generating functions that are rational and whose poles are rational roots of unity.

Examples

  • Given a d-dimensional convex polytope P with rational vertices v1,,vn, define tP to be the convex hull of tv1,,tvn. The function L(P,t)=#(tPd) is a quasi-polynomial in t (viewed as a positive integer variable) of degree d; the minimal positive integer r such that rP has integer vertices is a period of L(P,t). This is known as the Ehrhart quasi-polynomial, named after Eugène Ehrhart.
  • Given two quasi-polynomials F and G, the convolution of F and G is
(F*G)(k)=m=0kF(m)G(km)
which is a quasi-polynomial with degree degF+degG+1.

References

  1. Stanley, Richard P. (1997). "Section 4.4: Quasipolynomials". Enumerative Combinatorics, Volume 1. Cambridge University Press. ISBN 0-521-56069-1. http://www-math.mit.edu/~rstan/ec/. 
  2. Beck, Matthias; Sanyal, Raman (2018), "Section 4.5: Quasipolynomials", Combinatorial Reciprocity Theorems: An Invitation to Enumerative Geometric Combinatorics, Graduate Studies in Mathematics, American Mathematical Society, ISBN 978-1-4704-2200-4