Frequency Addition Source of Optical Radiation: Difference between revisions
en>Yobot m WP:CHECKWIKI error fixes +genfixes using AWB (7205) |
en>Ferdw corrected subject-predicate agreement (plurality) |
||
Line 1: | Line 1: | ||
{{for|quasi-polynomial time complexity of algorithms|Quasi-polynomial time}} | |||
In [[mathematics]], a '''quasi-polynomial''' ('''pseudo-polynomial''') is a generalization of [[polynomial]]s. While the coefficients of a polynomial come from a [[ring (mathematics)|ring]], the coefficients of quasi-polynomials are instead [[periodic function]]s with integral period. Quasi-polynomials appear throughout much of [[combinatorics]] as the enumerators for various objects. | |||
A quasi-polynomial can be written as <math>q(k) = c_d(k) k^d + c_{d-1}(k) k^{d-1} + \cdots + c_0(k)</math>, where <math>c_{i}(k)</math> is a periodic function with integral period. If <math>c_d(k)</math> is not identically zero, then the degree of ''q'' is ''d''. Equivalently, a function <math>f \colon \mathbb{N} \to \mathbb{N}</math> is a quasi-polynomial if there exist polynomials <math>p_0, \dots, p_{s-1}</math> such that <math>f(n) = p_i(n)</math> when <math>n \equiv i \bmod s</math>. The polynomials <math>p_i</math> are called the constituents of ''f''. | |||
==Examples== | |||
* Given a ''d''-dimensional [[polytope]] ''P'' with [[rational number|rational]] vertices <math>v_1,\dots,v_n</math>, define ''tP'' to be the [[convex hull]] of <math>tv_1,\dots,tv_n</math>. The function <math>L(P,t) = \#(tP \cap \mathbb{Z}^d)</math> is a quasi-polynomial in ''t'' of degree ''d''. In this case, ''L(P,t)'' is a function <math>\mathbb{N} \to \mathbb{N}</math>. 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 | |||
:<math>(F*G)(k) = \sum_{m=0}^k F(m)G(k-m)</math> | |||
which is a quasi-polynomial with degree <math>\le \deg F + \deg G + 1.</math> | |||
==See also== | |||
* [[Ehrhart polynomial]] | |||
==References== | |||
* [[Richard P. Stanley|Stanley, Richard P.]] (1997). [http://www-math.mit.edu/~rstan/ec/ ''Enumerative Combinatorics'', Volume 1]. Cambridge University Press. ISBN 0-521-55309-1, 0-521-56069-1. | |||
[[Category:Polynomials]] | |||
[[Category:Algebraic combinatorics]] | |||
{{combin-stub}} |
Latest revision as of 17:49, 5 April 2013
28 year-old Painting Investments Worker Truman from Regina, usually spends time with pastimes for instance interior design, property developers in new launch ec Singapore and writing. Last month just traveled to City of the Renaissance. 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 q is d. Equivalently, a function is a quasi-polynomial if there exist polynomials such that when . The polynomials are called the constituents of f.
Examples
- Given a d-dimensional polytope P with rational vertices , define tP to be the convex hull of . The function is a quasi-polynomial in t of degree d. In this case, L(P,t) is a function . 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
which is a quasi-polynomial with degree
See also
References
- Stanley, Richard P. (1997). Enumerative Combinatorics, Volume 1. Cambridge University Press. ISBN 0-521-55309-1, 0-521-56069-1.