- polynomial partition
- мат. разбиение многочлена
Большой англо-русский и русско-английский словарь. 2001.
polynomial partition
Смотреть что такое "polynomial partition" в других словарях:
Partition problem — In computer science, the partition problem is an NP complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two halves that have the same sum. More precisely, given a multiset S of integers, is… … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… … Wikipedia
Schur polynomial — In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables with integral coefficients. The elementary symmetric polynomials and the complete homogeneous symmetric polynomials are special cases of… … Wikipedia
Symmetric polynomial — This article is about individual symmetric polynomials. For the ring of symmetric polynomials, see ring of symmetric functions. In mathematics, a symmetric polynomial is a polynomial P(X1, X2, …, Xn) in n variables, such that if any of the… … Wikipedia
Macdonald polynomial — In mathematics, Macdonald polynomials P λ are a two parameter family of orthogonal polynomials indexed by a positive weight λ of a root system, introduced by Ian G. Macdonald (1987). They generalize several other families of orthogonal… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Bernstein polynomial — In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.A numerically stable way to… … Wikipedia
3-partition problem — The 3 partition problem is an NP complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triples that all have the same sum. More precisely, given a multiset S of n = 3 m… … Wikipedia
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
Hall polynomial — The Hall polynomials in mathematics were developed by Philip Hall in the 1950s in the study of group representations. These polynomials are the structure constants of a certain associative algebra, called the Hall algebra, which plays an… … Wikipedia
