Search Results for ""

Gieseking's constant is defined by G = int_0^(2pi/3)ln(2cos(1/2x))dx (1) = Cl_2(1/3pi) (2) = (3sqrt(3))/4[1-sum_(k=0)^(infty)1/((3k+2)^2)+sum_(k=1)^(infty)1/((3k+1)^2)] (3) = ...

The Goh-Schmutz constant is defined by the integrals C = int_0^infty(ln(1+t))/(e^t-1)dt (1) = int_0^inftyln[1-ln(1-e^(-t))]dt (2) = ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

The contour C_epsilon illustrated above.

A symbol used to represent the point and space groups (e.g., 2/m3^_). Some symbols have abbreviated form. The equivalence between Hermann-Mauguin symbols (a.k.a. ...

A pyramidal number of the form n(n+1)(4n-1)/6, The first few are 1, 7, 22, 50, 95, ... (OEIS A002412). The generating function of the hexagonal pyramidal numbers is ...

A term for number theory.

Given a positive sequence {a_n}, sqrt(sum_(j=-infty)^infty|sum_(n=-infty; n!=j)^infty(a_n)/(j-n)|^2)<=pisqrt(sum_(n=-infty)^infty|a_n|^2), (1) where the a_ns are real and ...

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.