Search Results for ""

A generalization of the concept of set unions and intersections.

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.

A discrete distribution of a random variable such that every possible value can be represented in the form a+bn, where a,b!=0 and n is an integer.

A lattice embedding is a one-to-one lattice homomorphism.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice endomorphism is a mapping h:L->L that preserves both meets and joins.

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

In the plane, there are 17 lattice groups, eight of which are pure translation. In R^3, there are 32 point groups and 230 space groups. In R^4, there are 4783 space lattice ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.