Search Results for ""

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

D_(KY)=j+(sigma_1+...+sigma_j)/(|sigma_(j+1)|), (1) where sigma_1<=sigma_n are Lyapunov characteristic exponents and j is the largest integer for which ...

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

Given any set B, the associated pair groupoid is the set B×B with the maps alpha(a,b)=a and beta(a,b)=b, and multiplication (a,b)·(b,c)=(a,c). The inverse is ...

Given a vector space V, its projectivization P(V), sometimes written P(V-0), is the set of equivalence classes x∼lambdax for any lambda!=0 in V-0. For example, complex ...

There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...

The set of all planes through a line. The line is sometimes called the axis of the sheaf, and the sheaf itself is sometimes called a pencil (Altshiller-Court 1979, p. 12; ...