Discrete geometry | Unsolved problems in geometry | Conjectures
In combinatorial geometry, the Hadwiger conjecture states that any convex body in n-dimensional Euclidean space can be covered by 2n or fewer smaller bodies homothetic with the original body, and that furthermore, the upper bound of 2n is necessary if and only if the body is a parallelepiped. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body. The Hadwiger conjecture is named after Hugo Hadwiger, who included it on a list of unsolved problems in 1957; it was, however, previously studied by and independently, . Additionally, there is a different Hadwiger conjecture concerning graph coloring—and in some sources the geometric Hadwiger conjecture is also called the Levi–Hadwiger conjecture or the Hadwiger–Levi covering problem. The conjecture remains unsolved even in three dimensions, though the two dimensional case was resolved by . (Wikipedia).
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
Pablo Shmerkin: 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
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)
Pablo Shmerkin: 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
Topics in Combinatorics lecture 11.6 --- Two applications of Shearer's lemma
In the previous video I stated and proved Shearer's entropy lemma. Here I give two applications. The first provides an upper bound for the number of triangles a graph with m edges can have. The second is an upper bound for the size of a family of graphs with vertex set {1,2,...,n} if the i
From playlist Topics in Combinatorics (Cambridge Part III course)
Inna Zakharevich : Coinvariants, assembler K-theory, and scissors congruence
CONFERENCE Recording during the thematic meeting : « Chromatic Homotopy, K-Theory and Functors» the January 24, 2023 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Jean Petit Find this video and other talks given by worldwide mathematicians on CIR
From playlist Topology
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
Singular Hodge Theory for Combinatorial Geometries by Jacob Matherne
PROGRAM COMBINATORIAL ALGEBRAIC GEOMETRY: TROPICAL AND REAL (HYBRID) ORGANIZERS: Arvind Ayyer (IISc, India), Madhusudan Manjunath (IITB, India) and Pranav Pandit (ICTS-TIFR, India) DATE & TIME: 27 June 2022 to 08 July 2022 VENUE: Madhava Lecture Hall and Online Algebraic geometry is t
From playlist Combinatorial Algebraic Geometry: Tropical and Real (HYBRID)
Combinatorial applications of the Hodge–Riemann relations – June Huh – ICM2018
Combinatorics Invited Lecture 13.5 Combinatorial applications of the Hodge–Riemann relations June Huh Abstract: Why do natural and interesting sequences often turn out to be log-concave? We give one of many possible explanations, from the viewpoint of “standard conjectures”. We illustrat
From playlist Combinatorics
Generalizing GKZ secondary fan using Berkovich geometry by Tony Yue Yu
PROGRAM COMBINATORIAL ALGEBRAIC GEOMETRY: TROPICAL AND REAL (HYBRID) ORGANIZERS: Arvind Ayyer (IISc, India), Madhusudan Manjunath (IITB, India) and Pranav Pandit (ICTS-TIFR, India) DATE & TIME: 27 June 2022 to 08 July 2022 VENUE: Madhava Lecture Hall and Online Algebraic geometry is t
From playlist Combinatorial Algebraic Geometry: Tropical and Real (HYBRID)
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
Singular Hodge theory of matroids - Jacob Matherne
Joint IAS/Princeton University Algebraic Geometry Seminar Topic: Singular Hodge theory of matroids Speaker: Jacob Matherne Affiliation: Member, School of Mathematics Date: March 25, 2019 For more video please visit http://video.ias.edu
From playlist Joint IAS/PU Algebraic Geometry
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)
Hard Lefschetz Theorem and Hodge-Riemann Relations for Combinatorial Geometries - June Huh
June Huh Princeton University; Veblen Fellow, School of Mathematics November 9, 2015 https://www.math.ias.edu/seminars/abstract?event=47563 A conjecture of Read predicts that the coefficients of the chromatic polynomial of a graph form a log-concave sequence for any graph. A related conj
From playlist Members Seminar
Hodge theory for combinatorial geometries - June Huh
Short Talks by Postdoctoral Members June Huh - September 22, 2015 http://www.math.ias.edu/calendar/event/88194/1442952900/1442953800 More videos on http://video.ias.edu
From playlist Short Talks by Postdoctoral Members
Aubrey de Grey on his Mathematics Research and Longevity | Hadwiger- Nelson Problem.
I got lucky to have Dr. de Grey talk to me about his mathematics research and his academic life in general. In 2018, he proved that the chromatic number of a plane should be at least 5. The original paper can be found here: https://arxiv.org/abs/1804.02385 You can contact Aubrey via thi
From playlist Interviews
Tony Yue Yu - 1/4 The Frobenius Structure Conjecture for Log Calabi-Yau Varieties
Notes: https://nextcloud.ihes.fr/index.php/s/GwJbsQ8xMW2ifb8 1/4 - Motivation and ideas from mirror symmetry, main results. --- We show that the naive counts of rational curves in an affine log Calabi-Yau variety U, containing an open algebraic torus, determine in a surprisingly simple wa
From playlist Tony Yue Yu - The Frobenius Structure Conjecture for Log Calabi-Yau Varieties
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
Jessica Purcell - Lecture 1 - Hyperbolic knots and alternating knots
Jessica Purcell, Monash University Title: Hyperbolic knots and alternating knots Hyperbolic geometry has been used since around the mid-1970s to study knot theory, but it can be difficult to relate geometry of knots to a diagram of a knot. However, many results from the 1980s and beyond s
From playlist 39th Annual Geometric Topology Workshop (Online), June 6-8, 2022