Search Results for ""

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

The second knot polynomial discovered. Unlike the first-discovered Alexander polynomial, the Jones polynomial can sometimes distinguish handedness (as can its more powerful ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...

A polynomial in which the sum of subscripts is the same in each term.

A sequence of polynomials p_i(x), for i=0, 1, 2, ..., where p_i(x) is exactly of degree i for all i.

The Schur polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=1.

Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...

The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...