Quasi-polynomial

In mathematics, a quasi-polynomial (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.

A quasi-polynomial can be written as , where is a periodic function with integral period. If is not identically zero, then the degree of is . Equivalently, a function is a quasi-polynomial if there exist polynomials such that when . The polynomials are called the constituents of .

Examples

  • Given a -dimensional polytope with rational vertices , define to be the convex hull of . The function is a quasi-polynomial in of degree . In this case, is a function . This is known as the Ehrhart quasi-polynomial, named after Eugène Ehrhart.
  • Given two quasi-polynomials and , the convolution of and is

which is a quasi-polynomial with degree

gollark: > While the algorithm is of immense theoretical importance, it is not used in practice, rendering it a galactic algorithm. For 64-bit inputs, the Baillie–PSW primality test is deterministic and runs many orders of magnitude faster. For larger inputs, the performance of the (also unconditionally correct) ECPP and APR tests is far superior to AKS. Additionally, ECPP can output a primality certificate that allows independent and rapid verification of the results, which is not possible with the AKS algorithm.
gollark: I mean, it's probably true, right?
gollark: Assume the Riemann hypothesis and use the miller test?
gollark: Also osmarksISA™ assemblies.
gollark: This is* useful.

See also

References

  • Stanley, Richard P. (1997). Enumerative Combinatorics, Volume 1. Cambridge University Press. ISBN 0-521-55309-1, 0-521-56069-1.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.