Search Results for ""

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

There are a number of attractive polyhedron compounds consisting of ten octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...

An n-dimensional open disk of radius r is the collection of points of distance less than r from a fixed point in Euclidean n-space. Krantz (1999, p. 3) uses the symbol D(x,r) ...

An inner automorphism of a group G is an automorphism of the form phi(g)=h^(-1)gh, where h is a fixed element of G. An outer automorphism of G is an automorphism which cannot ...

Two planes that do not intersect are said to be parallel. Two planes specified in Hessian normal form are parallel iff |n_1^^·n_2^^|=1 or n_1^^xn_2^^=0 (Gellert et al. 1989, ...

A hypersphere S^n is parallelizable if there are n vector fields that are linearly independent at each point. There exist only three parallelizable spheres: S^1, S^3, and S^7 ...

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...