This is a list of

polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example ...

topics, by Wikipedia page. See also

trigonometric polynomial In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(''nx'') and cos(''nx'') with ''n'' taking on the values of one or more natural numbers. The c ...

list of algebraic geometry topics This is a list of algebraic geometry topics, by Wikipedia page. Classical topics in projective geometry *Affine space * Projective space *Projective line, cross-ratio *Projective plane **Line at infinity **Complex projective plane *Complex projec ...

Terminology

Degree Degree may refer to: As a unit of measurement * Degree (angle), a unit of angle measurement ** Degree of geographical latitude ** Degree of geographical longitude * Degree symbol (°), a notation used in science, engineering, and mathematics ...

: The maximum exponents among the monomials. *

Factor Factor, a Latin word meaning "who/which acts", may refer to: Commerce * Factor (agent), a person who acts for, notably a mercantile and colonial agent * Factor (Scotland), a person or firm managing a Scottish estate * Factors of production, suc ...

: An expression being multiplied. * Linear factor: A factor of degree one. * Coefficient: An expression multiplying one of the monomials of the polynomial. * Root (or zero) of a polynomial: Given a polynomial ''p''(''x''), the ''x'' values that satisfy ''p''(''x'') = 0 are called roots (or zeroes) of the polynomial ''p''. * Graphing **End behaviour – **

Concavity In calculus, the second derivative, or the second order derivative, of a function is the derivative of the derivative of . Roughly speaking, the second derivative measures how the rate of change of a quantity is itself changing; for example, ...

– **Orientation – ** Tangency point – **

Inflection point In differential calculus and differential geometry, an inflection point, point of inflection, flex, or inflection (British English: inflexion) is a point on a smooth plane curve at which the curvature changes sign. In particular, in the case ...

– Point where concavity changes.

Basics

Polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example ...

* Coefficient *

Monomial In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered: # A monomial, also called power product, is a product of powers of variables with nonnegative integer expone ...

Polynomial long division In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, becau ...

Synthetic division In algebra, synthetic division is a method for manually performing Euclidean division of polynomials, with less writing and fewer calculations than long division. It is mostly taught for division by linear monic polynomials (known as the Ruffini ...

Polynomial factorization In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same dom ...

* Rational function *

Partial fraction In algebra, the partial fraction decomposition or partial fraction expansion of a rational fraction (that is, a fraction such that the numerator and the denominator are both polynomials) is an operation that consists of expressing the fraction a ...

** Partial fraction decomposition over R *

Vieta's formulas In mathematics, Vieta's formulas relate the coefficients of a polynomial to sums and products of its roots. They are named after François Viète (more commonly referred to by the Latinised form of his name, "Franciscus Vieta"). Basic formulas ...

Integer-valued polynomial In mathematics, an integer-valued polynomial (also known as a numerical polynomial) P(t) is a polynomial whose value P(n) is an integer for every integer ''n''. Every polynomial with integer coefficients is integer-valued, but the converse is not tr ...

Algebraic equation In mathematics, an algebraic equation or polynomial equation is an equation of the form :P = 0 where ''P'' is a polynomial with coefficients in some field, often the field of the rational numbers. For many authors, the term ''algebraic equation'' ...

Factor theorem In algebra, the factor theorem is a theorem linking factors and zeros of a polynomial. It is a special case of the polynomial remainder theorem. The factor theorem states that a polynomial f(x) has a factor (x - \alpha) if and only if f(\alpha)=0 ...

Polynomial remainder theorem In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An exampl ...

Elementary abstract algebra

:''See also Theory of equations below.'' *

Polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables ...

* Greatest common divisior of two polynomials *

Symmetric function In mathematics, a function of n variables is symmetric if its value is the same no matter the order of its arguments. For example, a function f\left(x_1,x_2\right) of two arguments is a symmetric function if and only if f\left(x_1,x_2\right) = f ...

Homogeneous polynomial In mathematics, a homogeneous polynomial, sometimes called quantic in older texts, is a polynomial whose nonzero terms all have the same degree. For example, x^5 + 2 x^3 y^2 + 9 x y^4 is a homogeneous polynomial of degree 5, in two variables; ...

Polynomial SOS In mathematics, a form (i.e. a homogeneous polynomial) ''h''(''x'') of degree 2''m'' in the real ''n''-dimensional vector ''x'' is sum of squares of forms (SOS) if and only if there exist forms g_1(x),\ldots,g_k(x) of degree ''m'' such that h(x ...

(sum of squares)

Theory of equations In algebra, the theory of equations is the study of algebraic equations (also called "polynomial equations"), which are equations defined by a polynomial. The main problem of the theory of equations was to know when an algebraic equation has an ...

* Polynomial family ** Quadratic function **

Cubic function In mathematics, a cubic function is a function of the form f(x)=ax^3+bx^2+cx+d where the coefficients , , , and are complex numbers, and the variable takes real values, and a\neq 0. In other words, it is both a polynomial function of degree ...

Quartic function In algebra, a quartic function is a function of the form :f(x)=ax^4+bx^3+cx^2+dx+e, where ''a'' is nonzero, which is defined by a polynomial of degree four, called a quartic polynomial. A '' quartic equation'', or equation of the fourth de ...

Quintic function In algebra, a quintic function is a function of the form :g(x)=ax^5+bx^4+cx^3+dx^2+ex+f,\, where , , , , and are members of a field, typically the rational numbers, the real numbers or the complex numbers, and is nonzero. In other words, a ...

** Sextic function **

Septic function Septic may refer to: * Septic shock, a medical condition * Septic tank or septic system, a component of a small scale sewage disposal system * Septic equation, a polynomial of degree seven * Slang term for "American" in the Cockney dialect See ...

** Octic function *

Completing the square : In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form :ax^2 + bx + c to the form :a(x-h)^2 + k for some values of ''h'' and ''k''. In other words, completing the square places a perfe ...

Abel–Ruffini theorem In mathematics, the Abel–Ruffini theorem (also known as Abel's impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here, ''general'' means th ...

* Bring radical *

Binomial theorem In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial into a sum involving terms of the form , where the ...

* Blossom (functional) * Root of a function * ''n''th root (radical) ** Surd **

Square root In mathematics, a square root of a number is a number such that ; in other words, a number whose ''square'' (the result of multiplying the number by itself, or  ⋅ ) is . For example, 4 and −4 are square roots of 16, because . ...

Methods of computing square roots Methods of computing square roots are numerical analysis algorithms for approximating the principal, or non-negative, square root (usually denoted \sqrt, \sqrt /math>, or S^) of a real number. Arithmetically, it means given S, a procedure for fi ...

** Cube root **

Root of unity In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power . Roots of unity are used in many branches of mathematics, and are especially important ...

Constructible number In geometry and algebra, a real number r is constructible if and only if, given a line segment of unit length, a line segment of length , r, can be constructed with compass and straightedge in a finite number of steps. Equivalently, r is cons ...

** Complex conjugate root theorem *

Algebraic element In mathematics, if is a field extension of , then an element of is called an algebraic element over , or just algebraic over , if there exists some non-zero polynomial with coefficients in such that . Elements of which are not algebraic over ...

Horner scheme In mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. Although named after William George Horner, this method is much older, as it has been attributed to Joseph-Louis Lagrange by Hor ...

Rational root theorem In algebra, the rational root theorem (or rational root test, rational zero theorem, rational zero test or theorem) states a constraint on rational solutions of a polynomial equation :a_nx^n+a_x^+\cdots+a_0 = 0 with integer coefficients a_i\in ...

Gauss's lemma (polynomial) In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statementThis theorem is called a lemma for historical reasons. about polynomials over the integers, or, more generally, over a unique factorization domain (that is, a ring that ha ...

Irreducible polynomial In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted f ...

Eisenstein's criterion In mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers – that is, for it to not be factorizable into the product of non-constant polynomials with ...

** Primitive polynomial *

Fundamental theorem of algebra The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non- constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomia ...

* Hurwitz polynomial *

Polynomial transformation In mathematics, a polynomial transformation consists of computing the polynomial whose roots are a given function of the roots of a polynomial. Polynomial transformations such as Tschirnhaus transformations are often used to simplify the solutio ...

Tschirnhaus transformation In mathematics, a Tschirnhaus transformation, also known as Tschirnhausen transformation, is a type of mapping on polynomials developed by Ehrenfried Walther von Tschirnhaus in 1683. Simply, it is a method for transforming a polynomial equation ...

Galois theory In mathematics, Galois theory, originally introduced by Évariste Galois, provides a connection between field theory and group theory. This connection, the fundamental theorem of Galois theory, allows reducing certain problems in field theory to ...

* Discriminant of a polynomial **

Resultant In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (ove ...

Elimination theory Elimination may refer to: Science and medicine *Elimination reaction, an organic reaction in which two functional groups split to form an organic product *Bodily waste elimination, discharging feces, urine, or foreign substances from the body ...

Gröbner basis In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field . A Gröbn ...

Regular chain In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular s ...

Triangular decomposition In computer algebra, a triangular decomposition of a polynomial system is a set of simpler polynomial systems such that a point is a solution of if and only if it is a solution of one of the systems . When the purpose is to describe the solut ...

* Sturm's theorem *

Descartes' rule of signs In mathematics, Descartes' rule of signs, first described by René Descartes in his work ''La Géométrie'', is a technique for getting information on the number of positive real roots of a polynomial. It asserts that the number of positive roots i ...

* Carlitz–Wan conjecture * Polynomial decomposition, factorization under functional composition

Calculus with polynomials

Delta operator In mathematics, a delta operator is a shift-equivariant linear operator Q\colon\mathbb \longrightarrow \mathbb /math> on the vector space of polynomials in a variable x over a field \mathbb that reduces degrees by one. To say that Q is shift-equi ...

Bernstein–Sato polynomial In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by and , . It is also known as the b-function, the b-polynomial, and the Bernstein polynomial, though it is not related ...

Polynomial interpolation In numerical analysis, polynomial interpolation is the interpolation of a given data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of data points (x_0,y_0), \ldots, (x_n,y_n), with no ...

Lagrange polynomial In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a data set of coordinate pairs (x_j, y_j) with 0 \leq j \leq k, the x_j are called ''nodes'' an ...

Runge's phenomenon In the mathematical field of numerical analysis, Runge's phenomenon () is a problem of oscillation at the edges of an interval that occurs when using polynomial interpolation with polynomials of high degree over a set of equispaced interpolation ...

Spline (mathematics) In mathematics, a spline is a special function defined piecewise by polynomials. In interpolating problems, spline interpolation is often preferred to polynomial interpolation because it yields similar results, even when using low degree po ...

Weierstrass approximation theorem Karl Theodor Wilhelm Weierstrass (german: link=no, Weierstraß ; 31 October 1815 – 19 February 1897) was a German mathematician often cited as the "father of modern analysis". Despite leaving university without a degree, he studied mathematics ...

Bernstein polynomial In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial that is a linear combination of Bernstein basis polynomials. The idea is named after Sergei Natanovich Bernstein. A numerically stable way to evaluate pol ...

Linear algebra Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrices ...

* Characteristic polynomial * Minimal polynomial *

Invariant polynomial In mathematics, an invariant polynomial is a polynomial P that is invariant under a group \Gamma acting on a vector space V. Therefore, P is a \Gamma-invariant polynomial if :P(\gamma x) = P(x) for all \gamma \in \Gamma and x \in V. Cases of p ...

Named polynomials and polynomial sequences

* Abel polynomials * Actuarial polynomials *

Additive polynomial In mathematics, the additive polynomials are an important topic in classical algebraic number theory. Definition Let ''k'' be a field of prime characteristic ''p''. A polynomial ''P''(''x'') with coefficients in ''k'' is called an additive pol ...

s *

All one polynomial In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one. Over the finite field of order two, conditions for the AOP to be irreducible are known, which allow this polynomial to be used to define efficient alg ...

s *

Appell sequence In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence \_ satisfying the identity :\frac p_n(x) = np_(x), and in which p_0(x) is a non-zero constant. Among the most notable Appell sequences besides the ...

Askey–Wilson polynomials In mathematics, the Askey–Wilson polynomials (or ''q''-Wilson polynomials) are a family of orthogonal polynomials introduced by as q-analogs of the Wilson polynomials. They include many of the other orthogonal polynomials in 1 variable as special ...

* Bell polynomials * Bernoulli polynomials *

* Bessel polynomials *

Binomial type In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers \left\ in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities :p_ ...

Caloric polynomial In differential equations, the ''m''th-degree caloric polynomial (or heat polynomial) is a "parabolically ''m''-homogeneous" polynomial ''P'm''(''x'', ''t'') that satisfies the heat equation : \frac = \frac. "Parabolically ''m''-homog ...

* Charlier polynomials * Chebyshev polynomials *

Chihara–Ismail polynomials In mathematics, the Chihara–Ismail polynomials are a family of orthogonal polynomials introduced by , generalizing the van Doorn polynomials introduced by and the Karlin–McGregor polynomials. They have a rather unusual measure, which is discr ...

Cyclotomic polynomials In mathematics, the ''n''th cyclotomic polynomial, for any positive integer ''n'', is the unique irreducible polynomial with integer coefficients that is a divisor of x^n-1 and is not a divisor of x^k-1 for any Its roots are all ''n''th primit ...

* Dickson polynomial *

Ehrhart polynomial In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number of integer points the polytope contains. The theory of Ehrhart polynomials can be seen as a highe ...

Exponential polynomial In mathematics, exponential polynomials are functions on fields, rings, or abelian groups that take the form of polynomials in a variable and an exponential function. Definition In fields An exponential polynomial generally has both a variable ' ...

s * Favard's theorem * Fibonacci polynomials *

Gegenbauer polynomials In mathematics, Gegenbauer polynomials or ultraspherical polynomials ''C''(''x'') are orthogonal polynomials on the interval minus;1,1with respect to the weight function (1 − ''x''2)''α''–1/2. They generalize Legendre polynom ...

Hahn polynomials In mathematics, the Hahn polynomials are a family of orthogonal polynomials in the Askey scheme of hypergeometric orthogonal polynomials, introduced by Pafnuty Chebyshev in 1875 and rediscovered by Wolfgang Hahn . The Hahn class is a name for spec ...

* Hall–Littlewood polynomials *Heat polynomial — see

caloric polynomial In differential equations, the ''m''th-degree caloric polynomial (or heat polynomial) is a "parabolically ''m''-homogeneous" polynomial ''P'm''(''x'', ''t'') that satisfies the heat equation : \frac = \frac. "Parabolically ''m''-homog ...

Heckman–Opdam polynomials In mathematics, Heckman–Opdam polynomials (sometimes called Jacobi polynomials) ''P''λ(''k'') are orthogonal polynomials in several variables associated to root systems. They were introduced by . They generalize Jack polynomials when the roots ...

* Hermite polynomials * Hurwitz polynomial *

Jack function In mathematics, the Jack function is a generalization of the Jack polynomial, introduced by Henry Jack. The Jack polynomial is a homogeneous, symmetric polynomial which generalizes the Schur and zonal polynomials, and is in turn generalized by ...

Jacobi polynomials In mathematics, Jacobi polynomials (occasionally called hypergeometric polynomials) P_n^(x) are a class of classical orthogonal polynomials. They are orthogonal with respect to the weight (1-x)^\alpha(1+x)^\beta on the interval 1,1/math>. The ...

Koornwinder polynomials In mathematics, Macdonald-Koornwinder polynomials (also called Koornwinder polynomials) are a family of orthogonal polynomials in several variables, introduced by and I. G. Macdonald (1987, important special cases), that generalize the Askey–Wi ...

* Kostka polynomial * Kravchuk polynomials *

Laguerre polynomials In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are solutions of Laguerre's equation: xy'' + (1 - x)y' + ny = 0 which is a second-order linear differential equation. This equation has nonsingular solutions on ...

Laurent polynomial In mathematics, a Laurent polynomial (named after Pierre Alphonse Laurent) in one variable over a field \mathbb is a linear combination of positive and negative powers of the variable with coefficients in \mathbb. Laurent polynomials in ''X'' f ...

Linearised polynomial In mathematics, a linearised polynomial (or ''q''-polynomial) is a polynomial for which the exponents of all the constituent monomials are powers of ''q'' and the coefficients come from some extension field of the finite field of order ''q''. We ...

Littlewood polynomial In mathematics, a Littlewood polynomial is a polynomial all of whose coefficients are +1 or −1. Littlewood's problem asks how large the values of such a polynomial must be on the unit circle in the complex plane. The answer to this would yi ...

Legendre polynomials In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applica ...

* Associated Legendre polynomials **

Spherical harmonic In mathematics and physical science, spherical harmonics are special functions defined on the surface of a sphere. They are often employed in solving partial differential equations in many scientific fields. Since the spherical harmonics form ...

* Lucas polynomials *

Macdonald polynomials In mathematics, Macdonald polynomials ''P''λ(''x''; ''t'',''q'') are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald origi ...

Meixner polynomials In mathematics, Meixner polynomials (also called discrete Laguerre polynomials) are a family of discrete orthogonal polynomials introduced by . They are given in terms of binomial coefficients and the (rising) Pochhammer symbol In mathematics, t ...

* Necklace polynomial *

Newton polynomial In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes called Newton's divided differences interp ...

Orthogonal polynomials In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the class ...

* Orthogonal polynomials on the unit circle *

Permutation polynomial In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map x \mapsto g(x) is a bijection. In case the ring is a finite field, the Dickson polynomials, whic ...

Racah polynomials In mathematics, Racah polynomials are orthogonal polynomials named after Giulio Racah, as their orthogonality relations are equivalent to his orthogonality relations for Racah coefficients. The Racah polynomials were first defined by and are giv ...

Rogers polynomials In mathematics, the Rogers polynomials, also called Rogers–Askey–Ismail polynomials and continuous q-ultraspherical polynomials, are a family of orthogonal polynomials introduced by in the course of his work on the Rogers–Ramanujan identitie ...

* Rogers–Szegő polynomials * Rook polynomial *

Schur polynomial In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in ''n'' variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In ...

s *

Shapiro polynomials In mathematics, the Shapiro polynomials are a polynomial sequence, sequence of polynomials which were first studied by Harold S. Shapiro in 1951 when considering the magnitude of specific trigonometric sums. In signal processing, the Shapiro polynom ...

Sheffer sequence In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are ...

* Spread polynomials *

Tricomi–Carlitz polynomials In mathematics, the Tricomi–Carlitz polynomials or (Carlitz–)Karlin–McGregor polynomials are polynomials studied by and and , related to random walks on the positive integers. They are given in terms of Laguerre polynomials In mathematics, ...

Touchard polynomials The Touchard polynomials, studied by , also called the exponential polynomials or Bell polynomials, comprise a polynomial sequence of binomial type defined by :T_n(x)=\sum_^n S(n,k)x^k=\sum_^n \left\x^k, where S(n,k)=\left\is a Stirling numbe ...

Wilkinson's polynomial In numerical analysis, Wilkinson's polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbatio ...

Wilson polynomials In mathematics, Wilson polynomials are a family of orthogonal polynomials introduced by that generalize Jacobi polynomials, Hahn polynomials, and Charlier polynomials. They are defined in terms of the generalized hypergeometric function and the ...

Zernike polynomials In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after optical physicist Frits Zernike, winner of the 1953 Nobel Prize in Physics and the inventor of phase-contrast microscopy, th ...

** Pseudo-Zernike polynomials

Knot polynomial In the mathematical field of knot theory, a knot polynomial is a knot invariant in the form of a polynomial whose coefficients encode some of the properties of a given knot. History The first knot polynomial, the Alexander polynomial, was introdu ...
s

Alexander polynomial In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type. James Waddell Alexander II discovered this, the first knot polynomial, in 1923. In 1969, John Conway showed a ve ...

HOMFLY polynomial In the mathematical field of knot theory, the HOMFLY polynomial or HOMFLYPT polynomial, sometimes called the generalized Jones polynomial, is a 2-variable knot polynomial, i.e. a knot invariant in the form of a polynomial of variables ''m'' and ' ...

Jones polynomial In the mathematical field of knot theory, the Jones polynomial is a knot polynomial discovered by Vaughan Jones in 1984. Specifically, it is an invariant of an oriented knot or link which assigns to each oriented knot or link a Laurent polynomi ...

Algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...
s

Karatsuba multiplication The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. Knuth D.E. (1969) ''The Art of Computer Programming. v.2.'' Addison-Wesley Publ.Co., 724 pp. It is a divi ...

Lenstra–Lenstra–Lovász lattice basis reduction algorithm The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis \mathbf = \ with ''n''-dimensional int ...

(for polynomial factorization) * Lindsey–Fox algorithm *

Schönhage–Strassen algorithm The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971.A. Schönhage and V. Strassen,Schnelle Multiplikation großer Zahlen, '' ...

Other

Polynomial mapping {{DEFAULTSORT:Polynomial Topics Mathematics-related lists *List