Lattice (order)

Summary

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). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor. Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These lattice-like structures all admit order-theoret

Official source

https://en.wikipedia.org/wiki/Lattice_(order)

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (53)

Related publications

Related people (6)

Related people

Related units (3)

Related units

Related concepts (56)

Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is kno

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic opera

Related concepts

Related courses (14)

Related courses

Related lectures (30)

Related lectures

On the Mordell-Weil lattice of y(2) = x(3) + bx plus t(3n+1) in characteristic 3

Gauthier Leterrier

We study the elliptic curves given by y(2) = x(3) + bx + t(3n+1) over global function fields of characteristic 3 ; in particular we perform an explicit computation of the L-function by relating it to the zeta function of a certain superelliptic curve u(3) + bu = v(3n+1). In this way, using the Neron-Tate height on the Mordell-Weil group, we obtain lattices in dimension 2.3(n) for every n >= 1, which improve on the currently best known sphere packing densities in dimensions 162 (case n = 4) and 486 (case n = 5). For n = 3, the construction has the same packing density as the best currently known sphere packing in dimension 54, and for n = 1 it has the same density as the lattice E-6 in dimension 6.

SPRINGER INT PUBL AG2022

Let L be a lattice in . This paper provides two methods to obtain upper bounds on the number of points of L contained in a small sphere centered anywhere in . The first method is based on the observation that if the sphere is sufficiently small then the lattice points contained in the sphere give rise to a spherical code with a certain minimum angle. The second method involves Gaussian measures on L in the sense of Banaszczyk (Math Ann 296:625-635, 1993). Examples where the obtained bounds are optimal include some root lattices in small dimensions and the Leech lattice. We also present a natural decoding algorithm for lattices constructed from lattices of smaller dimension, and apply our results on the number of lattice points in a small sphere to conclude on the performance of this algorithm.

Springer US2013

Lattice theoretic approach to space-time codes from division algebras

Cyril Becker

This master project on algebraic coding theory gathers various techniques from lattice theory, central simple algebras and algebraic number theory. The thesis begins with the formulation of the engineering problem into mathematical form. It presents how space-time codes appeared, and how we can construct codes based on Q(i)-central division algebras. More precisely, it is explained how we can build codes from cyclic division algebras; and a generalization is done with the introduction of crossed product algebras. The approach used is slightly more geometric than what is usually done in the literature. We also give slight generalization to known methods for analyzing minimum determinants of division algebra-based codes.

2012