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

Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...

For a point P inside an equilateral triangle DeltaABC, the sum of the perpendiculars p_i from P to the sides of the triangle is equal to the altitude h. This result is simply ...

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

The Banach space L^1([0,1]) with the product (fg)(x)=int_0^xf(x-y)g(y)dy is a non-unital commutative Banach algebra. This algebra is called the Volterra algebra.

A triple integral over three coordinates giving the volume within some region G, V=intintint_(G)dxdydz.

If the top and bottom bases of a solid are equal in area, lie in parallel planes, and every section of the solid parallel to the bases is equal in area to that of the base, ...

Vorobiev's theorem states that if F_l^2|F_k, then F_l|k, where F_n is a Fibonacci number and a|b means a divides b. The theorem was discovered by Vorobiev in 1942, but not ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...