Search Results for ""

Let G be a group and theta n permutation of G. Then theta is an orthomorphism of G if the self-mapping nu of G defined by nu(x)=x^(-1)theta(x) is also an permutation of G.

In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.

The number of outward directed graph edges from a given graph vertex in a directed graph.

A symbol employed in a formal propositional calculus.

The two-dimensional version of the ham sandwich theorem.

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

A set of blocks, also called a resolution class, that partition the set V, where (V,B) is a balanced incomplete block design.

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

For a partial order, the size of the longest chain is called the length.

For a partial order, the size of the longest antichain is called the width.