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 . 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. A Laurent polynomial with coefficients in a field is an expression of the form where X is a formal variable, the summation index k is an integer (not necessarily positive) and only finitely many coefficients pk are non-zero. Two Laurent polynomials are equal if their coefficients are equal. Such expressions can be added, multiplied, and brought back to the same form by reducing similar terms. Formulas for addition and multiplication are exactly the same as for the ordinary polynomials, with the only difference that both positive and negative powers of X can be present: and Since only finitely many coefficients ai and bj are non-zero, all sums in effect have only finitely many terms, and hence represent Laurent polynomials. A Laurent polynomial over C may be viewed as a Laurent series in which only finitely many coefficients are non-zero. The ring of Laurent polynomials R[X, X −1] is an extension of the polynomial ring R[X ] obtained by "inverting X ". More rigorously, it is the localization of the polynomial ring in the multiplicative set consisting of the non-negative powers of X. Many properties of the Laurent polynomial ring follow from the general properties of localization. The ring of Laurent polynomials is a subring of the rational functions. The ring of Laurent polynomials over a field is Noetherian (but not Artinian). If R is an integral domain, the units of the Laurent polynomial ring R[X, X −1] have the form uX k, where u is a unit of R and k is an integer.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.