Kneser graph

Topics in Combinatorics lecture 6.9 -- Two applications of the Borsuk-Ulam theorem

Here I show how to use the Borsuk-Ulam theorem to find a graph with no short odd cycles but with very high chromatic number, and then to give a solution to the Kneser conjecture. The latter concerns the chromatic number of the Kneser graph, which has as its vertex set the set of all subset

From playlist Topics in Combinatorics (Cambridge Part III course)

Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

Lecture 8: Recurrent Neural Networks and Language Models

Lecture 8 covers traditional language models, RNNs, and RNN language models. Also reviewed are important training problems and tricks, RNNs for other sequence tasks, and bidirectional and deep RNNs. ------------------------------------------------------------------------------- Natural L

From playlist Lecture Collection | Natural Language Processing with Deep Learning (Winter 2017)

Joel Hass - Lecture 1 - Algorithms and complexity in the theory of knots and manifolds - 18/06/18

School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Joel Hass (University of California at Davis, USA) Algorithms and complexity in the theory of knots and manifolds Abstract: These lectures will introduce algorithmic pro

From playlist Joel Hass - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects

Neil Dummigan: Automorphic forms on Feit's Hermitian lattices

The lecture was held within the framework of the Hausdorff Trimester Program: Periods in Number Theory, Algebraic Geometry and Physics. Abstract: Feit showed, in 1978, that the genus of unimodular hermitian lattices of rank 12 over the Eisenstein integers contains precisely 20 classes. C

From playlist Workshop: "Periods and Regulators"

Graph Theory: 03. Examples of Graphs

We provide some basic examples of graphs in Graph Theory. This video will help you to get familiar with the notation and what it represents. We also discuss the idea of adjacent vertices and edges. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https

From playlist Graph Theory part-1

Avi Wigderson & László Lovász - The Abel Prize interview 2021

00:30 Interview start 01:03 On the place of discrete math and theoretical computer science 08:14 Turing and Hilbert 14:28 P vs NP problem, what is it and why is it important? 25:09 Youth in Haifa, Avi Wigderson 30:09 Youth in Budapest, László Lovász 37:45 Problem solver or theory builde

From playlist László Lovász

Raimar WULKENHAAR - Solvable Dyson-Schwinger Equations

Dyson-Schwinger equations provide one of the most powerful non-perturbative approaches to quantum field theories. The quartic analogue of the Kontsevich model is a toy model for QFT in which the tower of Dyson-Schwinger equations splits into one non-linear equation for the planar two-point

From playlist Talks of Mathematics Münster's reseachers

What are Connected Graphs? | Graph Theory

What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr

From playlist Graph Theory

Products of primes in arithmetic progressions - Joni Teräväinen

Special Year Research Seminar Topic: Products of primes in arithmetic progressions Speaker: Joni Teräväinen Affiliation: University of Turku, von Neumann Fellow, School of Mathematics Date: December 06, 2022 A conjecture of Erdős states that for every large enough prime q, every reduced

From playlist Mathematics