Search Results for ""

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

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

Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...

A parallelogram is a quadrilateral with opposite sides parallel (and therefore opposite angles equal). A quadrilateral with equal sides is called a rhombus, and a ...

Inspired by computer simulations of fossilized worms trails published by Raup and Seilacher (1969), computer scientist Mike Paterson at the University of Warwick and ...

The pentagram, also called the five-point star, pentacle, pentalpha, or pentangle, is the star polygon {5/2}. It is a pagan religious symbol that is one of the oldest symbols ...

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

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

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...