Search Results for ""

The dissection of the four pieces shown at left into the capital letter "T" shown at right.

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...

The symbol tau (the lower case Greek letter tau) has many common uses in mathematics, as summarized in the following table. 1. tau(n) is an alternate notation for the divisor ...

A ring torus constructed out of a square of side length c can be dissected into two squares of arbitrary side lengths a and b (as long as they are consistent with the size of ...

The function defined by y_+^alpha={y^alpha for y>0; 0 for y<=0. (1)

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.

Young's lattice Y_p is the partial order of partitions contained within a partition p ordered by containment (Stanton and White 1986; Skiena 1990, p. 77).

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.