Search Results for ""
3831 - 3840 of 7050 for 3Search Results

Any lemma on commutative diagrams. It can give relations between maps (as in the five lemma) or tell how to construct new diagrams from old ones (as in the snake lemma).
The Dirichlet lambda function lambda(x) is the Dirichlet L-series defined by lambda(x) = sum_(n=0)^(infty)1/((2n+1)^x) (1) = (1-2^(-x))zeta(x), (2) where zeta(x) is the ...
For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...
To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...
The dodecahedron-small triambic icosahedron compound is a stellated form of a truncated icosahedron, but a different truncation than in the truncated icosahedron Archimedean ...
A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...
A compound of five regular dodecahedra with the symmetry of the icosahedron (Wenninger 1983, pp. 145-147) can be constructed by taking a dodecahedron with top and bottom ...
The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...
A family of functors H_n(·) from the category of pairs of topological spaces and continuous maps, to the category of Abelian groups and group homomorphisms satisfies the ...
The first solution to Lamé's differential equation, denoted E_n^m(x) for m=1, ..., 2n+1. They are also called Lamé functions. The product of two ellipsoidal harmonics of the ...

...