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 Alexander invariant H_*(X^~) of a knot K is the homology of the infinite cyclic cover of the complement of K, considered as a module over Lambda, the ring of integral ...

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. ...

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 ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

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 ...