In coding theory, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight. Let C ⊂ F 2...

Look up enumerator in Wiktionary, the free dictionary. Enumerator may refer to: Iterator (computer science) An enumerator in the context of iteratees...

equal to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in enumerative combinatorics and algebraic combinatorics...

orthogonal polynomials are the classical orthogonal polynomials, consisting of the Hermite polynomials, the Laguerre polynomials and the Jacobi polynomials. The...

elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed...

symmetric polynomial is a polynomial P(X1, X2, ..., Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally...

computer science In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is...

quasi-polynomials are instead periodic functions with integral period. Quasi-polynomials appear throughout much of combinatorics as the enumerators for...

In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling...

elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In representation theory they are the characters of polynomial irreducible...

preprocessing phase is generally assumed to be polynomial in the input. Backtracking: The simplest way to enumerate all solutions is by systematically exploring...

task and runs in polynomial time (as opposed to, say, exponential time), meaning the task completion time is bounded above by a polynomial function on the...

In combinatorial mathematics, a rook polynomial is a generating polynomial of the number of ways to place non-attacking rooks on a board that looks like...

mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This means that a polynomial F(X) of degree m...

In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after optical physicist Frits Zernike...

The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a...

repetition of values may be necessary in this case. Diophantine: There is a polynomial p with integer coefficients and variables x, a, b, c, d, e, f, g, h, i...

check Damm algorithm Dual code EXIT chart Error-correcting code Enumerator polynomial Fletcher's checksum Forward error correction Forward-backward algorithm...

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays...

in place of cycle index. Knowing the cycle index polynomial of a permutation group, one can enumerate equivalence classes due to the group's action. This...

In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number...

from an arbitrary field, its reciprocal polynomial or reflected polynomial, denoted by p∗ or pR, is the polynomial p ∗ ( x ) = a n + a n − 1 x + ⋯ + a 0...

provide a general algorithm that, for any given Diophantine equation (a polynomial equation with integer coefficients and a finite number of unknowns), can...

algorithms, an enumeration algorithm (i.e., an algorithm for listing a large or infinite collection of structures) is said to have polynomial delay if the...

functions precisely corresponds to the generating functions that enumerate quasi-polynomial sequences of the form f n = p 1 ( n ) ρ 1 n + ⋯ + p ℓ ( n ) ρ...

of polynomial equations (sometimes simply a polynomial system) is a set of simultaneous equations f1 = 0, ..., fh = 0 where the fi are polynomials in...

fields of graph theory and combinatorics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings...

homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression in complete...

In mathematics, sieved Pollaczek polynomials are a family of sieved orthogonal polynomials, introduced by Ismail (1985). Their recurrence relations are...

graph is called a matching polynomial. Let G be a graph and mk be the number of k-edge matchings. One matching polynomial of G is ∑ k ≥ 0 m k x k . {\displaystyle...