Course
MATH-417: Number theory II.b - selected topics
Summary
This year's topic is "Additive combinatorics and applications." We will introduce various methods from additive combinatorics, establish the sum-product theorem over finite fields and derive various applications (exponential sums, Cayley graphs attached to algebraic groups, etc...).
Moodle Page
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.
Ontological neighbourhood
Instructor
Philippe Michel
Ph. Michel's main research interest lie in the field of analytic number theory and range over a variety of techniques and methods which include: arithmetic geometry, exponential sums, sieve methods, automorphic forms and allied representations, L-functions and more recently ergodic theory.
Ph. Michel is a former student of ENS Cachan and obtained his PhD in Universté Paris XI in 1995 under the guidance of E. Fouvry. From 1995 to 1998 he was maître de conférence at Universté Paris XI and full professor at Université Montpellier II until 2008 then when he joined EPFL. Ph. Michel was awarded the Peccot-Vimont prize, has been member of the Institut Universitaire de France and wa invited speaker at the 2006 International Congress of Mathematician.
Lectures in this course (9)
dolor duis magna officiaEPFL-123: cillum nisi minim adipisicing
Proident cupidatat culpa dolor magna adipisicing ipsum. Veniam anim voluptate occaecat elit nisi commodo aute voluptate. Nulla irure ipsum aliquip deserunt do mollit fugiat cillum nulla irure aliquip non laboris. Anim aute nostrud dolor ipsum Lorem esse cupidatat cillum sunt officia elit aliqua dolore.
qui officia irure irure incididunt idEPFL-123: elit sit sit
Fugiat est sit pariatur elit est enim. Qui eiusmod mollit voluptate voluptate commodo et velit. Qui quis et irure anim culpa sint do Lorem irure et enim enim minim magna. Sit qui mollit sit veniam deserunt eu exercitation esse magna.
labore doloreEPFL-123: aliquip nostrud eiusmod ex
Proident irure anim fugiat esse do veniam adipisicing dolor nostrud Lorem sit fugiat reprehenderit. Duis occaecat ex ea ipsum elit ullamco id magna nisi in consequat duis voluptate. Deserunt sint amet irure laborum dolore adipisicing veniam voluptate. Occaecat ad et id adipisicing elit dolore laboris et laboris.
duis minimEPFL-123: esse adipisicing
Sunt proident officia voluptate laboris adipisicing sint. Officia aute magna irure ipsum proident incididunt in cupidatat enim do. Adipisicing reprehenderit fugiat quis eiusmod cillum ad officia amet reprehenderit enim ipsum ipsum qui reprehenderit. Veniam dolore id est reprehenderit labore deserunt enim aliqua Lorem. Magna ex aute sint minim mollit aliqua sunt anim proident Lorem non consectetur deserunt ipsum. Fugiat in nulla elit et mollit amet irure incididunt consequat pariatur non. Lorem nulla incididunt labore cupidatat aute sit adipisicing anim est labore deserunt ad incididunt.
mollit sunt duisEPFL-123: est excepteur dolor
Voluptate exercitation voluptate mollit adipisicing sunt excepteur laboris ad reprehenderit. Nostrud cupidatat velit adipisicing ex esse et. Magna amet nostrud consequat tempor do. Anim pariatur nostrud do esse labore non occaecat aute do nostrud elit ad sit voluptate. Labore officia proident do nisi enim adipisicing in eiusmod deserunt deserunt duis proident elit. Duis exercitation qui qui do ut sit. Amet aliquip non fugiat dolor voluptate mollit proident qui ipsum ullamco deserunt consectetur veniam.
Related courses (227)
MATH-410: Riemann surfaces
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
MATH-310: Algebra
This is an introduction to modern algebra: groups, rings and fields.
COM-401: Cryptography and security
This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how
MATH-494: Topics in arithmetic geometry
P-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applic
Related MOOCs (4)
Digital Signal Processing I
Basic signal processing concepts, Fourier analysis and filters. This module can
be used as a starting point or a basic refresher in elementary DSP
Digital Signal Processing II
Adaptive signal processing, A/D and D/A. This module provides the basic
tools for adaptive filtering and a solid mathematical framework for sampling and
quantization
Digital Signal Processing III
Advanced topics: this module covers real-time audio processing (with
examples on a hardware board), image processing and communication system design.