Search Results for ""

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

What is the longest ladder that can be moved around a right-angled hallway of unit width? For a straight, rigid ladder, the answer is 2sqrt(2), which allows the ladder to ...

Müntz's theorem is a generalization of the Weierstrass approximation theorem, which states that any continuous function on a closed and bounded interval can be uniformly ...

Let rho(x)dx be the fraction of time a typical dynamical map orbit spends in the interval [x,x+dx], and let rho(x) be normalized such that int_0^inftyrho(x)dx=1 over the ...

Let H be a subgroup of a group G. The similarity transformation of H by a fixed element x in G not in H always gives a subgroup. If xHx^(-1)=H for every element x in G, then ...

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