Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Lattices: More on Hermite's Theorem

In course

MATH-489: Number theory II.d - Cryptography

. ...

Description

This lecture delves into Hermite's Theorem, focusing on lattices and Hermite's constant. The content covers Minkowski's first theorem, lattice points, and examples illustrating the theorems. The lecture also discusses the properties of centrally symmetric lattices and the conditions for a lattice to have a lattice point.

Instructor

Dimitar Petkov Jetchev

Official source

Related concepts (20)

Lattice (group)

In geometry and group theory, a lattice in the real coordinate space is an infinite set of points in this space with the properties that coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point.

Integer lattice

In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted \mathbb{Z}^n, is the lattice in the Euclidean space \mathbb{R}^n whose lattice points are n-tuples of integers. The two-dimensional integer lattice is also called the square lattice, or grid lattice. \mathbb{Z}^n is the simplest example of a root lattice. The integer lattice is an odd unimodular lattice. The automorphism group (or group of congruences) of the integer lattice consists of all permutations and sign changes of the coordinates, and is of order 2n n!.

Lattice (order)

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.

Complete lattice

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 known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.

Zintl phase

In chemistry, a Zintl phase is a product of a reaction between a group 1 (alkali metal) or group 2 (alkaline earth metal) and main group metal or metalloid (from groups 13, 14, 15, or 16). It is characterized by intermediate metallic/ionic bonding. Zintl phases are a subgroup of brittle, high-melting intermetallic compounds that are diamagnetic or exhibit temperature-independent paramagnetism and are poor conductors or semiconductors. This type of solid is named after German chemist Eduard Zintl who investigated them in the 1930s.

Related lectures (14)

Crystallography: Describing Periodic Structures

Covers crystallography, lattice structures, vectors, and diffraction patterns.

Electron Diffraction: Basics and Applications

Covers the fundamentals of electron diffraction and its applications in understanding crystal structures and symmetry, including lattice vectors, lattice planes, and dark-field imaging techniques.

Relations and Sequences

Covers relations, sequences, and posets, emphasizing properties like anti-symmetry and transitivity, and introduces arithmetic and geometric progressions.

Quantization: Topological Operators

Covers the quantization of topological operators and Ising models on square lattices.

Dynamics on Homogeneous Spaces and Interactions with Number Theory