Search Results for ""

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? ...

The ten-of-diamonds decahedron is a stereohedron and space-filling polyhedron on 8 vertices, 16 edges, and 10 faces (8 of which are non-equilateral triangles and two of which ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

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

To find the motion of a rectangular membrane with sides of length L_x and L_y (in the absence of gravity), use the two-dimensional wave equation ...

A theorem of fundamental importance in spectroscopy and angular momentum theory which provides both (1) an explicit form for the dependence of all matrix elements of ...

Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...

A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace 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, ...