Search Results for ""

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

The Killing form is an inner product on a finite dimensional Lie algebra g defined by B(X,Y)=Tr(ad(X)ad(Y)) (1) in the adjoint representation, where ad(X) is the adjoint ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The Koolen-Riebeek graph is a weakly regular graph on 486 vertices with parameters (nu,k,lambda,mu)=(486,45,0,(0,9)). It is distance-regular but not distance-transitive with ...

If theta is a given irrational number, then the sequence of numbers {ntheta}, where {x}=x-|_x_|, is dense in the unit interval. Explicitly, given any alpha, 0<=alpha<=1, and ...