Search Results for ""

A (k,l)-multigrade equation is a Diophantine equation of the form sum_(i=1)^ln_i^j=sum_(i=1)^lm_i^j (1) for j=1, ..., k, where m and n are l-vectors. Multigrade identities ...

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

The rhombic hexecontahedron is a 60-faced polyhedron that can be obtained by stellating the rhombic triacontahedron by placing a plane along each edge which is perpendicular ...

The (small) rhombicuboctahedron (Cundy and Rowlett 1989, p. 105), sometimes simply called the rhombicuboctahedron (Wenninger 1989, p. 27; Maeder 1997, Conway et al. 1999), is ...

A square root of x is a number r such that r^2=x. When written in the form x^(1/2) or especially sqrt(x), the square root of x may also be called the radical or surd. The ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...