Regular graphs | Individual graphs
In the mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in the orientable surface of genus 3, in which they form dual graphs. (Wikipedia).
This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/3kIo
From playlist 3D printing
Made from 24 heptagons. Source code and meshes here: https://github.com/timhutton/klein-quartic
From playlist Geometry
I made this video when I thought I had made a model of the Klein Quartic. But it is wrong, so please ignore it. You can find a corrected version here: https://www.youtube.com/watch?v=ADtwLnxLPTI
From playlist Geometry
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
This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/2p3Z
From playlist 3D printing
This video explains the definitions of simple graphs, multigraphs, connected and not connected graphs, complete graphs, and the Handshake lemma. mathispower4u.com
From playlist Graph Theory (Discrete Math)
https://github.com/timhutton/klein-quartic This is work in progress. The transition is linear at the moment, which causes a lot of self-intersection.
From playlist Geometry
Graph Theory: 04. Families of Graphs
This video describes some important families of graph in Graph Theory, including Complete Graphs, Bipartite Graphs, Paths and Cycles. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https://www.youtube.com/watch?v=S1Zwhz-MhCs (Graph Theory: 02. Definit
From playlist Graph Theory part-1
Gunnar Carlsson (11/11/2021): Topological Deep Learning
Abstract: Deep Learning is a very powerful methodology that has a vst array of applications in many domains. Some of the problems that it has include "data hungriness", difficulty in generalization, and a general lack of transparency. I will discuss some TDA-inspired approaches building
From playlist AATRN 2021
Quantifying nonorientability and filling multiples of embedded curves - Robert Young
Analysis Seminar Topic: Quantifying nonorientability and filling multiples of embedded curves Speaker: Robert Young Affiliation: New York University; von Neumann Fellow, School of Mathematics Date: October 5, 2020 For more video please visit http://video.ias.edu
From playlist Mathematics
Gunnar Carlsson (5/1/21): Topological Deep Learning
Machine learning using neural networks is a very powerful methodology which has demonstrated utility in many different situations. In this talk I will show how work in the mathematical discipline called topological data analysis can be used to (1) lessen the amount of data needed in order
From playlist TDA: Tutte Institute & Western University - 2021
Gunnar Carlsson (5/9/22): Deep Learning and TDA
I will talk about some ways in which TDA interacts with the Deep Learning methodology. TDA can contribute to explainability as well as to the performance of Deep Learning models.
From playlist Bridging Applied and Quantitative Topology 2022
Your Brain will overload: Symmetry on Graph Neural Networks - R. Feynman to Bronstein
Explain Graph Neural Networks GNN, given current advances in Vision-NN or Language-NN with BERT. It all depends on the symmetry group of your input data! If you desire Lie groups, jump right in! Beginning with Landau-Lifschitz mathematics on conservation laws on physical systems, we visit
From playlist Learn Graph Neural Networks: code, examples and theory
The Five Color Theorem (without Kempe chains)
Submission for the #SoME2 competition. Most animations were done in manim (https://www.manim.community/), and the 3d images were rendered using svg3d (https://github.com/prideout/svg3d). Proofs: The degree of a vertex or a face is the number of edge incidences (edges that meet a vertex o
From playlist Summer of Math Exposition 2 videos
Professor Gunnar Carlsson , Stanford University, USA
From playlist Public Lectures
Robert YOUNG - Quantifying nonorientability and filling multiples of embedded curves
Abstract: https://indico.math.cnrs.fr/event/2432/material/17/0.pdf
From playlist Riemannian Geometry Past, Present and Future: an homage to Marcel Berger
What Every Physicist Should Know About String Theory: Edward Witten
https://strings2015.icts.res.in/talkTitles.php Table of Contents (powered by https://videoken.com) 0:00:00 Introduction 0:01:05 [Talk: What Every Physicist Should Know About String Theory by Edward Witten] 0:02:46 Anyone who has studied physics is familiar with the fact that while physics
From playlist Strings 2015 conference
What is a Subgraph? | Graph Theory
What is a subgraph? We go over it in today's math lesson! If you're familiar with subsets, then subgraphs are probably exactly what you think they are. Recall that a graph G = (V(G), E(G)) is an ordered pair with a vertex set V(G) and an edge set E(G). Then, another graph H = (V(H), E(H))
From playlist Graph Theory
Gauß Lecture in Leipzig 2022 | László Lovász - Discrete or Continuous
László Lovász, professor at Eötvös Loránd University and Alfréd Rényi Institute of Mathematics in Budapest, gave the distinguished Gauß lecture on the topic Discrete or Continuous?, the question of the continuous nature of our world from a mathematical perspective. This ceremonial event of
From playlist Various Lectures