Search Results for ""

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

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...

The tesseract is the hypercube in R^4, also called the 8-cell or octachoron. It has the Schläfli symbol {4,3,3}, and vertices (+/-1,+/-1,+/-1,+/-1). The figure above shows a ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

An exchange of two elements of an ordered list with all others staying the same. A transposition is therefore a permutation of two elements. For example, the swapping of 2 ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to universality classes when studying a map of the Los Angeles ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

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