Introduction to Combinatory Logic – #SoME2
This is Alexander Farrugia's and Giorgio Grigolo's submission to the second 3blue1brown Summer of Math Exposition. #some2 #mathematics #combinators #logic Music: Icelandic Arpeggios – DivKid
From playlist Summer of Math Exposition 2 videos
Introduction to additive combinatorics lecture 10.8 --- A weak form of Freiman's theorem
In this short video I explain how the proof of Freiman's theorem for subsets of Z differs from the proof given earlier for subsets of F_p^N. The answer is not very much: the main differences are due to the fact that cyclic groups of prime order do not have lots of subgroups, so one has to
From playlist Introduction to Additive Combinatorics (Cambridge Part III course)
Peter Varju: Additive combinatorics methods in fractal geometry - lecture 2
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Peter Varju: Additive combinatorics methods in fractal geometry - lecture 1
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Aleksi Saarela : k-abelian complexity and fluctuation
Abstract : Words u and v are defined to be k-abelian equivalent if every factor of length at most k appears as many times in u as in v. The k-abelian complexity function of an infinite word can then be defined so that it maps a number n to the number of k-abelian equivalence classes of len
From playlist Combinatorics
Global symmetry from local information: The Graph Isomorphism Problem – László Babai – ICM2018
Combinatorics | Mathematical Aspects of Computer Science Invited Lecture 13.4 | 14.5 Global symmetry from local information: The Graph Isomorphism Problem László Babai Abstract: Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity stat
From playlist Combinatorics
Combinatorial Identities via both Algebraic and Combinatorial Proof [Discrete Math Class]
This video is not like my normal uploads. This is a supplemental video from one of my courses that I made in case students had to quarantine. This is a follow up to previous a video introducing combinatorial objects (in particular k-permutations and k-subsets) and a video about the sum and
From playlist Discrete Mathematics Course
Ivan Corwin: "Polymer partition functions and the geometric RSK correspondence"
Asymptotic Algebraic Combinatorics 2020 "Polymer partition functions and the geometric RSK correspondence" Ivan Corwin - Columbia University Abstract: I will describe two results based on the geometric lifting of the RSK correspondence (gRSK). The first says that partition functions for
From playlist Asymptotic Algebraic Combinatorics 2020
Due to the COVID-19 pandemic, Carnegie Mellon University is protecting the health and safety of its community by holding all large classes online. People from outside Carnegie Mellon University are welcome to tune in to see how the class is taught, but unfortunately Prof. Loh will not be o
From playlist CMU 21-228 Discrete Mathematics
Ramsey classes and sparsity for finite models - J. Nešetřil - Workshop 1 - CEB T1 2018
Jaroslav Nešetřil (Prague) / 31.01.2018 In the talk we relate two notions in the title particularly in the context of sparse dense dichotomy (nowhere and somewhere dense classes and stability) and Ramsey classes of finite models in the context of the characterisation programme. A joint wo
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Richard Stanley - Increasing and decreasing subsequences (2006)
slides for this talk: https://www.mathunion.org/fileadmin/IMU/Videos/ICM2006/tars/stanley2006.pdf ICM Madrid Videos 24.08.2006 Increasing and decreasing subsequences Richard P. Stanley Massachusetts Institute of Technology, Cambridge, USA 24-Aug-06 · 09:00-10:00 h https://www.mathunion.
From playlist Mathematics
Constraint Satisfaction Problems and Probabilistic Combinatorics II - Fotios Illiopoulos
Computer Science/Discrete Mathematics Seminar II Topic: Constraint Satisfaction Problems and Probabilistic Combinatorics II Speaker: Fotios Illiopoulos Affiliation: Member, School of Mathematics Date: November 26, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Frédéric Chapoton: Combinatorics and algebra of partially ordered sets - lecture 1
CIRM VIRTUAL EVENT Recorded during the meeting "French Computer Algebra Days" the March 03, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audio
From playlist Virtual Conference
Jörg Thuswaldner: Multidimensional continued fractions and symbolic codings of toral translations
CIRM VIRTUAL CONFERENCE Recorded during the meeting " Diophantine Problems, Determinism and Randomness" the November 24, 2020 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide
From playlist Virtual Conference
Peter Varju: Additive combinatorics methods in fractal geometry - lecture 3
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Introduction to additive combinatorics lecture 1.8 --- Plünnecke's theorem
In this video I present a proof of Plünnecke's theorem due to George Petridis, which also uses some arguments of Imre Ruzsa. Plünnecke's theorem is a very useful tool in additive combinatorics, which implies that if A is a set of integers such that |A+A| is at most C|A|, then for any pair
From playlist Introduction to Additive Combinatorics (Cambridge Part III course)
Sylvie Corteel: Le diamant aztèque - Cours 1
Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities: - Chapter markers and keywords to watch the parts of your choice in the video - Videos enriched with abstracts, b
From playlist Combinatorics
Mathilde Bouvel : Studying permutation classes using the substitution decomposition
Recording during the thematic meeting : "Pre-School on Combinatorics and Interactions" the January 09, 2017 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent
From playlist Combinatorics
Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 1
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics