Search Results for ""
5451 - 5460 of 6485 for Finite Group D 4Search Results
Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...
A torispherical dome is the surface obtained from the intersection of a spherical cap with a tangent torus, as illustrated above. The radius of the sphere R is called the ...
A system of curvilinear coordinates for which several different notations are commonly used. In this work (u,v,phi) is used, whereas Arfken (1970) uses (xi,eta,phi) and Moon ...
The function defined by (1) (Heatley 1943; Abramowitz and Stegun 1972, p. 509), where _1F_1(a;b;z) is a confluent hypergeometric function of the first kind and Gamma(z) is ...
Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...
The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...
A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...
The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...
...
View search results from all Wolfram sites (352745 matches)

