Parametric families of graphs | Regular graphs
Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph are the -element subsets of an -element set; two vertices are adjacent when the intersection of the two vertices (subsets) contains -elements. Both Johnson graphs and the closely related Johnson scheme are named after Selmer M. Johnson. (Wikipedia).
.svg?width=300)
From playlist 3d graphs
Graph of x^2 + 6xy + 5y^2 rotating
From playlist 3d graphs
From playlist 3d graphs
Platonic graphs and the Petersen graph
In this tutorial I show you to construct the five platonic graphs and the Peterson graph in Mathematica and we use some of the information in the previous lectures to look at some of the properties of these graphs, simply by looking at their graphical representation.
From playlist Introducing graph theory
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
Simple Definition of Petersen Graph | Graph Theory
We introduce the Petersen graph via a combinatorial definition using subsets. This definition of the Petersen graph is easy to understand and useful for proving various results about the graph. #GraphTheory A Petersen graph's vertices can be labeled by all two element subsets from a five
From playlist Graph Theory
From playlist 3d graphs
What are Cubic Graphs? | Graph Theory
What are cubic graphs? We go over this bit of graph theory in today's math lesson! Recall that a regular graph is a graph in which all vertices have the same degree. The degree of a vertex v is the number of edges incident to v, or equivalently the number of vertices adjacent to v. If ever
From playlist Graph Theory
Wanlin Li - The Ceresa class: tropical, topological, and local - AGONIZE mini-conference
The Ceresa cycle is an algebraic cycle attached to a smooth algebraic curve, which is trivial in the Chow ring when the curve is hyperelliptic. Its image under a certain cycle class map provides a class in étale cohomology called the Ceresa class. There are few examples where the Ceresa cl
From playlist Arithmetic Geometry is ONline In Zoom, Everyone (AGONIZE)
Boolean function analysis: beyond the Boolean cube (continued) - Yuval Filmus
http://www.math.ias.edu/seminars/abstract?event=129061 More videos on http://video.ias.edu
From playlist Mathematics
Graph of x^2 + y^2 + pxy as p varies
From playlist 3d graphs
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Jason Ku View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This lecture focuses on solving any all-pairs shortest paths (APSP) in w
From playlist MIT 6.006 Introduction to Algorithms, Spring 2020
Metric dimension reduction: A snapshot of the Ribe program – Assaf Naor – ICM2018
Plenary Lecture 16 Metric dimension reduction: A snapshot of the Ribe program Assaf Naor Abstract: The purpose of this article is to survey some of the context, achievements, challenges and mysteries of the field of ‘metric dimension reduction’, including new perspectives on major older
From playlist Plenary Lectures
Assaf Naor: Coarse dimension reduction
Recording during the thematic meeting "Non Linear Functional Analysis" the March 7, 2018 at 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 Audiovisual Ma
From playlist Analysis and its Applications
Sparsifying and Derandomizing the Johnson-Lindenstrauss Transform - Jelani Nelson
Jelani Nelson Massachusetts Institute of Technology January 31, 2011 The Johnson-Lindenstrauss lemma states that for any n points in Euclidean space and error parameter 0 less than eps less than 1/2, there exists an embedding into k = O(eps^{-2} * log n) dimensional Euclidean space so that
From playlist Mathematics
Beata Randrianantoanina: On a difference between two methods of low-distortion embeddings of...
Abstract: In a recent paper, the speaker and M.I. Ostrovskii developed a new metric embedding method based on the theory of equal-signs-additive (ESA) sequences developed by Brunel and Sucheston in 1970’s. This method was used to construct bilipschitz embeddings of diamond and Laakso graph
From playlist Analysis and its Applications
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
[BOURBAKI 2017] 14/01/2017 - 4/4 - Harald A. HELFGOTT
Isomorphismes de graphes en temps quasi-polynomial, d’après Babai et Luks Soient donnés deux graphes Γ1, Γ2 à n sommets. Y a-t-il une permutation des sommets qui envoie Γ1 sur Γ2 ? Si de telles permutations existent, elles forment une classe H · π du groupe symétrique sur n éléments. Comm
From playlist BOURBAKI - 2017
Ex 1: Solve a Linear Inequality Given Function Notation Using a Graph
Solving a linear inequality given using function notation by analyzing the graphs of two functions. http://mathispower4u.com
From playlist Linear Inequalities in One Variable Solving Linear Inequalities
17. Dynamic Programming, Part 3: APSP, Parens, Piano
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This is the third of four lectures on dynamic programming. This focu
From playlist MIT 6.006 Introduction to Algorithms, Spring 2020