Laurent polynomial
Laurent polynomial is a polynomial with finitely many terms of the form axⁿ where n ∈ ℤ.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2467685305
- Described as
- polynomial with finitely many terms of the form axⁿ where n ∈ ℤ
- Named after
- Pierre Alphonse Laurent
- Wikipedias with a page
- 10
Wikidata item Q1701125 (wikidata.org/wiki/Q1701125), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1352767295
In mathematics, a Laurent polynomial (named
after Pierre Alphonse Laurent) in one variable over a field 𝔽 is a linear combination of positive and negative powers of the variable with coefficients in 𝔽. Laurent polynomials in X form a ring denoted 𝔽[X,X−1]. They differ from ordinary polynomials in that they may have terms of negative degree. The construction of Laurent polynomials may be iterated, leading to the ring of Laurent polynomials in several variables. Laurent polynomials are of particular importance in the study of complex variables.
From the Wikipedia article “Laurent polynomial” (en.wikipedia.org/wiki/Laurent_polynomial), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
