Search Results for ""

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

If a subgroup H of G has a group representation phi:H×W->W, then there is a unique induced representation of G on a vector space V. The original space W is contained in V, ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

The German mathematician Kronecker proved that all the Galois extensions of the rationals Q with Abelian Galois groups are subfields of cyclotomic fields Q(mu_n), where mu_n ...

The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...

The continued fraction for K is [2; 1, 2, 5, 1, 1, 2, 1, 1, ...] (OEIS A002211). A plot of the first 256 terms of the continued fraction represented as a sequence of binary ...