Search Results for ""

A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

A number of attractive tetrahedron 10-compounds can be constructed. The first (left figures) can be obtained by combining tetrahedron 5-compounds of opposite chirality ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

The truncated great dodecahedron is the uniform polyhedron with Maeder index 37 (Maeder 1997), Wenninger index 75 (Wenninger 1989), Coxeter index 47 (Coxeter et al. 1954), ...

A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...