Search Results for ""

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A set of identities involving n-dimensional visible lattice points was discovered by Campbell (1994). Examples include product_((a,b)=1; ...

A conjecture which treats the heights of points relative to a canonical class of a curve defined over the integers.

A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...

A compact set W_infty with area mu(W_infty)=8/9(24)/(25)(48)/(49)...=pi/4 created by punching a square hole of length 1/3 in the center of a square. In each of the eight ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

A 4-polyhex.

Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...

If f is a continuous real-valued function on [a,b] and if any epsilon>0 is given, then there exists a polynomial p on [a,b] such that |f(x)-P(x)|<epsilon for all x in [a,b]. ...

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...