Search Results for ""

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

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

Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...

Given a reference triangle DeltaABC, the trilinear coordinates of a point P with respect to DeltaABC are an ordered triple of numbers, each of which is proportional to the ...

Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

Probability and Statistics

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...