Search Results for ""

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

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a meet-homomorphism, then h is a meet-embedding.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.

(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...

For a triangle DeltaABC and three points A^', B^', and C^', one on each of its sides, the three Miquel circles are the circles passing through each polygon vertex and its ...

The point of concurrence of the six planes in Monge's tetrahedron theorem.

The six planes through the midpoints of the edges of a tetrahedron and perpendicular to the opposite edges concur in a point known as the Monge point.