TOPICS
Search

Search Results for ""


411 - 420 of 1003 for div> <div class=Search Results
A figurate number of the form StOct_n = O_n+8Te_(n-1) (1) = n(2n^2-1), (2) where O_n is an octahedral number and Te_n is a tetrahedral number. The first few are 1, 14, 51, ...
A strong pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, the map v_m|->g_m(v_m,·) is an ...
A variety V of algebras is a strong variety provided that for each subvariety W of V, and each algebra A in V, if A is generated by its W- subalgebras, then A in W. In strong ...
A superabundant number is a composite number n such that sigma(n)/n>sigma(k)/k for all k<n, where sigma(n) is the divisor function. Superabundant numbers are closely related ...
A tetradic (or four-way) number is a number that remains unchanged when flipped back to front, mirrored up-down, or flipped up-down. Since the only numbers that remain ...
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 ...
A triangle tiling is a tiling of the plane by identical triangles. Any triangle tiles the plane (Wells 1991, p. 208). The total number of triangles (including inverted ones) ...
Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...
In Minkowski space, a twistor may be defined as a pair consisting of a spinor field and a complex conjugate spinor field satisfying the twistor equation.
The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...
1 ... 39|40|41|42|43|44|45 ... 101 Previous Next

...