Lecture

Lattices: Properties and Theta Functions

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-511: Number theory II.b - Modular forms

In this course we will introduce core concepts of the theory of modular forms and consider several applications of this theory to combinatorics, harmonic analysis, and geometric optimization. ...

Description

This lecture introduces the concept of lattices in Rd as discrete abelian subgroups, exploring examples and properties such as Gram matrices and dual lattices. The instructor discusses theta functions, their Fourier transforms, and the Poisson summation formula, emphasizing modular properties and transformation laws. The lecture concludes with the analysis of theta functions' growth and the existence of even unimodular lattices in higher dimensions.

Instructor

Maryna Viazovska

Maryna Viazovska did her bachelor studies at the Kyiv National Taras ShevchenkoUniversity and completed her MSc at the Technical University Kaiserslautern.She obtained her PhD in 2013 in Bonn.She was a postdoctoral researcher at the Institut des Hautes Etudes Scientifiquesand at the Humboldt University of Berlin, and in 2017 was a Minerva DistinguishedVisitor at Princeton University. She joined EPFL in 2017 as Tenure-Track AssistantProfessor and was promoted Full Professor in 2018.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

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.

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

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.

Related lectures (56)

Discrete Fourier Transform and FFTW

Explores Fourier series, Discrete Fourier Transform, FFTW library, and solving differential equations using FFT algorithms.

Crystal Structure: Real and Reciprocal Lattice

Explores crystal structure, real and reciprocal lattice, and Miller indices in the context of wave-particle duality and Schrodinger equation.

3 9* The fast Fourier transform

Reciprocal lattice: Shape effects MOOC: Transmission Electron Microscopy for Materials Sciences

Explains how sample geometry affects the size and shape of reciprocal lattice nodes in multiple beam scattering.