odd polynomial
Смотреть что такое "odd polynomial" в других словарях:
Cyclotomic polynomial — In algebra, the nth cyclotomic polynomial, for any positive integer n, is the monic polynomial: where the product is over all nth primitive roots of unity ω in a field, i.e. all the complex numbers ω of order n. Contents 1 Properties … Wikipedia
Newton polynomial — In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is the interpolation polynomial for a given set of data points in the Newton form. The Newton polynomial is sometimes called Newton s… … Wikipedia
Even and odd permutations — In mathematics, the permutations of a finite set (i.e. the bijective mappings from the set to itself) fall into two classes of equal size: the even permutations and the odd permutations. The parity (oddness or evenness) of a permutation sigma of… … Wikipedia
Kazhdan–Lusztig polynomial — In representation theory, a Kazhdan–Lusztig polynomial P y,w ( q ) is a member of a family of integral polynomials introduced in work of David Kazhdan and George Lusztig Harv|Kazhdan|Lusztig|1979. They are indexed by pairs of elements y , w of a… … Wikipedia
Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… … Wikipedia
Generic polynomial — In Galois theory, a branch of modern algebra, a generic polynomial for a finite group G and field F is a monic polynomial P with coefficients in the field L = F ( t 1, ..., t n ) of F with n indeterminates adjoined, such that the splitting field… … Wikipedia
Rook polynomial — Despite its name, the rook polynomial is used not only to solve chess recreational problems but also in a number of problems arising in combinatorial mathematics, group theory, and number theory.The coefficients of the rook polynomial represent… … Wikipedia
Palindromic polynomial — A polynomial is palindromic, if the sequence of its coefficients are a palindrome.Let P(x) = sum {i=0}^n a ix^i be a polynomial of degree n, then P is palindromic if a i = a {n i} for i=0...n.Similarly, P is called antipalindromic if a i = a {n… … Wikipedia
Mathematics of CRC — Cyclic Redundancy Check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around … Wikipedia
Fundamental theorem of algebra — In mathematics, the fundamental theorem of algebra states that every non constant single variable polynomial with complex coefficients has at least one complex root. Equivalently, the field of complex numbers is algebraically closed.Sometimes,… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
