Search Results for ""

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...

A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...

The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...

The unique magic square of order three. The Lo Shu is an associative magic square, but not a panmagic square.

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

A lattice L is locally bounded if and only if each of its finitely generated sublattices is bounded. Every locally bounded lattice is locally subbounded, and every locally ...

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...

An infinite sequence of homomorphisms of modules or additive Abelian groups ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... (1) such that, for all indices i in Z, ...