Search Results for ""

Line segment picking is the process of picking line segments at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

A mathematical problem, usually not requiring advanced mathematics, to which a solution is desired. Puzzles frequently require the rearrangement of existing pieces (e.g., 15 ...

Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic packings for ...

X is a spherical t-design in E iff it is possible to exactly determine the average value on E of any polynomial f of degree at most t by sampling f at the points of X. In ...

A unit is an element in a ring that has a multiplicative inverse. If a is an algebraic integer which divides every algebraic integer in the field, a is called a unit in that ...

The Zeckendorf representation of a positive integer n is a representation of n as a sum of nonconsecutive distinct Fibonacci numbers, n=sum_(k=2)^Lepsilon_kF_k, where ...

A figurate number, also (but mostly in texts from the 1500 and 1600s) known as a figural number (Simpson and Weiner 1992, p. 587), is a number that can be represented by a ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

A general prism is a polyhedron possessing two congruent polygonal faces and with all remaining faces parallelograms (Kern and Bland 1948, p. 28; left figure). A right prism ...