A Non-flag Arithmetic Regularity Lemma and Counting Lemma - Daniel Altman
Special Year Informal Seminar Topic: A Non-flag Arithmetic Regularity Lemma and Counting Lemma Speaker: Daniel Altman Affiliation: University of Oxford Date: March 10, 2023 We will discuss a version of the Green--Tao arithmetic regularity lemma and counting lemma which works in the gener
From playlist Mathematics
Burnside's Lemma (Part 2) - combining math, science and music
Part 1 (previous video): https://youtu.be/6kfbotHL0fs Orbit-stabilizer theorem: https://youtu.be/BfgMdi0OkPU Burnside's lemma is an interesting result in group theory that helps us count things with symmetries considered, e.g. in some situations, we don't want to count things that can be
From playlist Traditional topics, explained in a new way
Proof of Lemma and Lagrange's Theorem
Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys Proof of Lemma and Lagrange's Theorem. This video starts by proving that any two right cosets have the same cardinality. Then we prove Lagrange's Theorem which says that if H is a subgroup of a finite group G then the order of H div
From playlist Abstract Algebra
Algebraic and Combinatorial Proofs: C(n,k)=C(n,n-k)
This video provides an algebraic proof and three combinatorial proofs for a binomial identity.
From playlist Counting (Discrete Math)
Burnside's Lemma (Part 1) - combining group theory and combinatorics
A result often used in math competitions, Burnside's lemma is an interesting result in group theory that helps us count things with symmetries considered, e.g. in some situations, we don't want to count things that can be transformed into one another by rotation different, like in this cas
From playlist Traditional topics, explained in a new way
The Frobenius Problem - Method for Finding the Frobenius Number of Two Numbers
Goes over how to find the Frobenius Number of two Numbers.
From playlist ℕumber Theory
Theory of numbers: Gauss's lemma
This lecture is part of an online undergraduate course on the theory of numbers. We describe Gauss's lemma which gives a useful criterion for whether a number n is a quadratic residue of a prime p. We work it out explicitly for n = -1, 2 and 3, and as an application prove some cases of Di
From playlist Theory of numbers
Regularity lemma and its applications Part I - Fan Wei
Computer Science/Discrete Mathematics Seminar II Topic: Regularity lemma and its applications Part I Speaker: Fan Wei Affiliation: Member, School of Mathematics Dater: December 3, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Counting: Find the Number of 5-Digit Numbers Under Various Conditions
This video explains how to determine how many 5-digit numbers are possible under various conditions.
From playlist Counting (Discrete Math)
Graph regularity and counting lemmas - Jacob Fox
Conference on Graphs and Analysis Jacob Fox June 5, 2012 More videos on http://video.ias.edu
From playlist Mathematics
Regularity methods in combinatorics, number theory, and computer science - Jacob Fox
Marston Morse Lectures Topic: Regularity methods in combinatorics, number theory, and computer science Speaker: Jacob Fox Affiliation: Stanford University Date: October 24, 2016 For more videos, visit http://video.ias.edu
From playlist Mathematics
7. Szemerédi's graph regularity lemma II: triangle removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Continuing the discussion of Szemerédi's graph regularity
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
13. Sparse regularity and the Green-Tao theorem
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX After discussion of Ramanujan graphs, Prof. Zhao discusse
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
8. Szemerédi's graph regularity lemma III: further applications
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX After proving Roth's theorem last lecture, Prof. Zhao exp
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX In this first half of this lecture, Prof. Zhao shows how
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
9. Szemerédi's graph regularity lemma IV: induced removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains a strengthening of the graph regulari
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
A Tight Bound for Hypergraph Regularity - Guy Moshkovitz
Computer Science/Discrete Mathematics Seminar I Topic: A Tight Bound for Hypergraph Regularity Speaker: Guy Moshkovitz Affiliation: Harvard University Date: Febuary 27, 2018 For more videos, please visit http://video.ias.edu
From playlist Mathematics
15. Graph limits II: regularity and counting
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains how graph limits can be used to gener
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
The Green-Tao theorem and a relative Szemeredi theorem - Yufei Zhao
Slides for this talk: https://drive.google.com/file/d/1RdgY6N869MN5lJwl2jv1HwIgWky6aW5C/view?usp=sharing The Green-Tao theorem and a relative Szemeredi theorem - Yufei Zhao Abstract: The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the p
From playlist Mathematics
Counting Factors WITHOUT Listing All of Them // Math Minute [#33] [ALGEBRA]
If we want to find the number of proper divisors a given number or expression has, it's natural to begin listing out those factors. Once our list is complete, we can simply count up the number of items in the list, and we're done. However, as numbers and expressions get larger, it gets har
From playlist Math Minutes