Ads
related to: lattices in discrete mathematics
Search results
Results From The WOW.Com Content Network
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
Lattices are best thought of as discrete approximations of continuous groups (such as Lie groups). For example, it is intuitively clear that the subgroup of integer vectors "looks like" the real vector space in some sense, while both groups are essentially different: one is finitely generated and countable, while the other is not finitely generated and has the cardinality of the continuum.
Lattices have many significant applications in pure mathematics, ... A lattice is the symmetry group of discrete translational symmetry in n directions.
The mathematics behind formal concept analysis therefore is the theory of complete lattices. Another representation is obtained as follows: A subset of a complete lattice is itself a complete lattice (when ordered with the induced order) if and only if it is the image of an increasing and idempotent (but not necessarily extensive) self-map.
Lattice (discrete subgroup), a discrete subgroup of a topological group whose quotient carries an invariant finite Borel measure; Lattice (module), a module over a ring that is embedded in a vector space over a field; Lattice graph, a graph that can be drawn within a repeating arrangement of points
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions).