Search Results for ""

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

The gyroid, illustrated above, is an infinitely connected periodic minimal surface containing no straight lines (Osserman 1986) that was discovered by Schoen (1970). ...

The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

Given an arrangement of points, a line containing just two of them is called an ordinary line. Dirac (1951) conjectured that every sufficiently set of n noncollinear points ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

Let A be the area of a simply closed lattice polygon. Let B denote the number of lattice points on the polygon edges and I the number of points in the interior of the ...