Search Results for ""
3051 - 3060 of 7050 for 3Search Results
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 ...
A octagrammic prism is a prism formed by two regular octagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...
The orthogonal complement of a subspace V of the vector space R^n is the set of vectors which are orthogonal to all elements of V. For example, the orthogonal complement of ...
The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...
A group that coincides with its commutator subgroup. If G is a non-Abelian group, its commutator subgroup is a normal subgroup other than the trivial group. It follows that ...
int_0^z(t^mu)/(1+t)dt=z/(mu+1+((mu+1)^2z)/((mu+2)-(mu+1)z+((mu+2)^2z)/((mu+3)-(mu+2)z+...))) for mu>-1 and -1<z<=1 (Perron 1954-1957, p. 18; Borwein et al. 2004, p. 35).
A knot equivalent to a polygon in R^3, also called a tame knot. For a polygonal knot K, there exists a plane such that the orthogonal projection pi on it satisfies the ...
The rectifiable sets include the image of any Lipschitz function f from planar domains into R^3. The full set is obtained by allowing arbitrary measurable subsets of ...
The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...
A polyhedron constructed by ruling 2n equally spaced vertical lines along the surface of a cylinder together with 2n^3 circles around the cylinder at equally spaced heights. ...
...
View search results from all Wolfram sites (353798 matches)

