Lecture

Applications of Ergodic Theory to Combinatorics

Description

This lecture by the instructor covers the applications of ergodic theory to combinatorics and number theory. Topics include Szemerédi's Theorem on arithmetic progressions, Erdős' Conjecture, measure-preserving systems, the Omega function, the Erdős-Kac Theorem, and the unpredictability of the number of prime factors in elements of deterministic sets.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

https://mediaspace.epfl.ch/media/0_kjo16jsg

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

Mathematics

Number theory: Topics in number theory

Mathematical logic: Set theory

Systems science and engineering

Systems theory: Chaos theory

Related lectures (34)

Graph Chatbot

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.