Search Results for ""

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

The pathological function f_a(x)=sum_(k=1)^infty(sin(pik^ax))/(pik^a) (originally defined for a=2) that is continuous but differentiable only on a set of points of measure ...

A transformation of a polynomial equation f(x)=0 which is of the form y=g(x)/h(x) where g and h are polynomials and h(x) does not vanish at a root of f(x)=0. The cubic ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

The divided difference f[x_0,x_1,x_2,...,x_n], sometimes also denoted [x_0,x_1,x_2,...,x_n] (Abramowitz and Stegun 1972), on n+1 points x_0, x_1, ..., x_n of a function f(x) ...

In his monumental treatise Disquisitiones Arithmeticae, Gauss conjectured that the class number h(-d) of an imaginary quadratic field with binary quadratic form discriminant ...

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...

The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...