Search Results for ""

If one root of the equation f(x)=0, which is irreducible over a field K, is also a root of the equation F(x)=0 in K, then all the roots of the irreducible equation f(x)=0 are ...

The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

Given a field F and an extension field K superset= F, an element alpha in K is called algebraic over F if it is a root of some nonzero polynomial with coefficients in F. ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

A number defined by b_n=b_n(0), where b_n(x) is a Bernoulli polynomial of the second kind (Roman 1984, p. 294), also called Cauchy numbers of the first kind. The first few ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

Chevalley's theorem, also known as the Chevalley-Waring theorem, states that if f is a polynomial in F[x_1,...,x_n], where F is a finite field of field characteristic p, and ...

Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...

Codimension is a term used in a number of algebraic and geometric contexts to indicate the difference between the dimension of certain objects and the dimension of a smaller ...