Raffaella Mulas - Spectral theory of hypergraphs
Hypergraphs are a generalization of graphs in which vertices are joined by edges of any size. In this talk, we generalize the graph normalized Laplace operators to the case of hypergraphs, and we discuss some properties of their spectra. We discuss the geometrical meaning of the largest an
From playlist Research Spotlight
John R. Parker: Complex hyperbolic lattices
Lattices in SU(2,1) can be viewed in several different ways: via their geometry as holomorphic complex hyperbolic isometries, as monodromy groups of hypergeometric functions, via algebraic geometry as ball quotients and (sometimes) using arithmeticity. In this talk I will describe these di
From playlist Geometry
Emilie Purvine (5/2/21): Homology of Graphs and Hypergraphs
Graphs and hypergraphs are typically studied from a combinatorial perspective. A graph being a collection of vertices and pairwise relationships (edges) among the vertices, and a hypergraph capturing multi-way or groupwise relationships (hyperedges) among the vertices. But both of these ob
From playlist TDA: Tutte Institute & Western University - 2021
Monodromy of nFn−1 hypergeometric functions and arithmetic groups II - Venkataramana
Speaker: T. N. Venkataramana (TIFR) Title: Monodromy of nFn−1 hypergeometric functions and arithmetic groups II We describe results of Levelt and Beukers-Heckman on the explicit computation of monodromy for generalised hypergeometric functions of one variable. We then discuss the question
From playlist Mathematics
Chidambaram Annamalai: Finding Perfect Matchings in Bipartite Hypergraphs
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perfect matching in the bipartite hypergrap
From playlist HIM Lectures: Trimester Program "Combinatorial Optimization"
Rainbow Matchings in Hypergraphs - Cosmin Pohoata
Computer Science/Discrete Mathematics Seminar II Topic: Rainbow Matchings in Hypergraphs Speaker: Cosmin Pohoata Affiliation: IAS - Member, School of Mathematics Date: February 14, 2023 Suppose we are given matchings M1,....,MN of size t in some r-uniform hypergraph, and let us think of
From playlist Mathematics
Thorsten Altenkirch - 1/2 Towards a Syntax for Cubical Type Theory
One of the key problems of Homotopy Type Theory is that it introduces axioms such as extensionality and univalence for which there is no known computational interpretation. We propose to overcome this by introducing a Type Theory where a heterogenous equality is defined recursively and equ
From playlist T2-2014 : Semantics of proofs and certified mathematics
Two conjectures of Ringel, by Katherine Staden
CMSA Combinatorics Seminar, 22 July 2020
From playlist CMSA Combinatorics Seminar
D. Brotbek - On the hyperbolicity of general hypersurfaces
A smooth projective variety over the complex numbers is said to be (Brody) hyperbolic if it doesn’t contain any entire curve. Kobayashi conjectured in the 70’s that general hypersurfaces of sufficiently large degree in PN are hyperbolic. This conjecture was only recently proved by Siu. Th
From playlist Complex analytic and differential geometry - a conference in honor of Jean-Pierre Demailly - 6-9 juin 2017
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
Introduction to Continuous Combinatorics II: semantic limits - Leonardo Coregliano
Computer Science/Discrete Mathematics Seminar II Topic: Introduction to Continuous Combinatorics II: semantic limits Speaker: Leonardo Coregliano Affiliation: Member, School of Mathematics Date: November 09, 2021 The field of continuous combinatorics studies large (dense) combinatorial s
From playlist Mathematics
Ariyan Javanpeykar: Arithmetic and algebraic hyperbolicity
Abstract: The Green-Griffiths-Lang-Vojta conjectures relate the hyperbolicity of an algebraic variety to the finiteness of sets of “rational points”. For instance, it suggests a striking answer to the fundamental question “Why do some polynomial equations with integer coefficients have onl
From playlist Algebraic and Complex Geometry
Quasirandom Hypergraphs - Dhruv Mubayi
Dhruv Mubayi University of Illinois at Chicago March 4, 2013 Since the foundational results of Thomason and Chung-Graham-Wilson on quasirandom graphs over 20 years ago, there has been a lot of effort by many researchers to extend the theory to hypergraphs. I will present some of this histo
From playlist Mathematics
Hyperbola 3D Animation | Objective conic hyperbola | Digital Learning
Hyperbola 3D Animation In mathematics, a hyperbola is a type of smooth curve lying in a plane, defined by its geometric properties or by equations for which it is the solution set. A hyperbola has two pieces, called connected components or branches, that are mirror images of each other an
From playlist Maths Topics
Bernd Schulze: Characterizing Minimally Flat Symmetric Hypergraphs
Scene analysis is concerned with the reconstruction of d-dimensional objects, such as polyhedral surfaces, from (d-1)-dimensional pictures (i.e., projections of the objects onto a hyperplane). This theory is closely connected to rigidity theory and other areas of discrete applied geometry,
From playlist HIM Lectures 2015
The Hypergraph Container Method, Partition Containers, and Algorithmic Applications - Or Zamir
Computer Science/Discrete Mathematics Seminar II Topic: The Hypergraph Container Method, Partition Containers, and Algorithmic Applications Speaker: Or Zamir Affiliation: Visitor, School of Mathematics Date: November 29, 2022 The recently-discoverd Hypergraph Container Method (Saxton an
From playlist Mathematics
Ling Long - Hypergeometric Functions, Character Sums and Applications - Lecture 6
Title: Hypergeometric Functions, Character Sums and Applications Speaker: Prof. Ling Long, Louisiana State University Abstract: Hypergeometric functions form a class of special functions satisfying a lot of symmetries. They are closely related to the arithmetic of one-parameter families of
From playlist Hypergeometric Functions, Character Sums and Applications
Monodromy of nFn−1 hypergeometric functions and arithmetic groups I - T.N. Venkatara
Speaker: T. N. Venkataramana (TIFR) Title: Monodromy of nFn−1 hypergeometric functions and arithmetic groups I Abstract: We describe results of Levelt and Beukers-Heckman on the explicit computation of monodromy for generalised hypergeometric functions of one variable. We then discuss the
From playlist Mathematics
The method of hypergraph containers – József Balogh & Robert Morris – ICM2018
Combinatorics Invited Lecture 13.6 The method of hypergraph containers József Balogh & Robert Morris Abstract: In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This te
From playlist Combinatorics