Search Results for ""

A sum over all cluster perimeters.

A finite division algebra is a field.

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...

A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...

A prime p_n is called "good" if p_n^2>p_(n-i)p_(n+i) for all 1<=i<=n-1 (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good ...

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].