Vidit Nanda (8/28/21): Principal components along quiver representations
Many interesting objects across pure and applied mathematics (including single and multiparameter persistence modules, cellular sheaves and connection matrices) are most naturally viewed as vector-space valued representations of a quiver. In this talk, I will describe a practical framework
From playlist Beyond TDA - Persistent functions and its applications in data sciences, 2021
Seminar on Applied Geometry and Algebra (SIAM SAGA): Jesús A. De Loera
Title: The Geometry of the Space of ALL Pivot Rules of a Linear Optimization Problem Speaker: Jesús A. De Loera, University of California Davis Date: Tuesday, April 12 2022 at 11:00am Eastern For more information, see our website: https://wiki.siam.org/siag-ag/index.php/Webinar
From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)
Graph Theory: 02. Definition of a Graph
In this video we formally define what a graph is in Graph Theory and explain the concept with an example. In this introductory video, no previous knowledge of Graph Theory will be assumed. --An introduction to Graph Theory by Dr. Sarada Herke. This video is a remake of the "02. Definitio
From playlist Graph Theory part-1
Raman Sanyal: Polyhedral geometry of pivot rules
Geometrically, a linear program gives rise to a polyhedron together with an orientation of its graph. A simplex method selects a path from any given vertex to the sink and thus determines an arborescence. The centerpiece of any simplex method is the pivot rule that selects the outgoing edg
From playlist Workshop: Tropical geometry and the geometry of linear programming
A subgraph consist of nodes and edges of a larger graph. In this tutorial I show you what a subgraph is and present an elegant representation in Mathematica. You can learn more about Mathematica on my Udemy course at https://www.udemy.com/mathematica/ PS! Wait until Udemy has a sale an
From playlist Introducing graph theory
Graph Theory: 36. Definition of a Tree
In this video I define a tree and a forest in graph theory. I discuss the difference between labelled trees and non-isomorphic trees. I also show why every tree must have at least two leaves. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/zxu0dL436gI
From playlist Graph Theory part-7
Introduction to Graph Theory: A Computer Science Perspective
In this video, I introduce the field of graph theory. We first answer the important question of why someone should even care about studying graph theory through an application perspective. Afterwards, we introduce definitions and essential terminology in graph theory, followed by a discuss
From playlist Graph Theory
Knot polynomials from Chern-Simons field theory and their string theoretic... by P. Ramadevi
Program: Quantum Fields, Geometry and Representation Theory ORGANIZERS : Aswin Balasubramanian, Saurav Bhaumik, Indranil Biswas, Abhijit Gadde, Rajesh Gopakumar and Mahan Mj DATE & TIME : 16 July 2018 to 27 July 2018 VENUE : Madhava Lecture Hall, ICTS, Bangalore The power of symmetries
From playlist Quantum Fields, Geometry and Representation Theory
Tamás Király: Blocking optimal k arborescences
Tamás Király: Blocking optimal k-arborescences Given a digraph D=(V,A) and a positive integer k, an arc set F ⊆ A is called a k-arborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvabl
From playlist HIM Lectures 2015
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
Graph Theory 37. Which Graphs are Trees
A proof that a graph of order n is a tree if and only if it is has no cycle and has n-1 edges. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/QFQlxtz7f6g - Graph Theory: 36. Definition of a Tree http://youtu.be/Yon2ndGQU5s - Graph Theory: 38. Three
From playlist Graph Theory part-7
Intro to Tree Graphs | Trees in Graph Theory, Equivalent Definitions
What are trees in graph theory? Tree graphs are connected graphs with no cycles. We'll introduce them and some equivalent definitions, with of course examples of tree graphs in today's graph theory video lesson! Some equivalent definitions of tree graphs are as follows. A graph is a tree
From playlist Graph Theory
Anna Seigal: "Principal Components along Quiver Representations"
Tensor Methods and Emerging Applications to the Physical and Data Sciences 2021 Workshop IV: Efficient Tensor Representations for Learning and Computational Complexity "Principal Components along Quiver Representations" Anna Seigal - University of Oxford, Mathematics Abstract: A quiver i
From playlist Tensor Methods and Emerging Applications to the Physical and Data Sciences 2021
Zoltán Szigeti: Packing of arborescences with matroid constraints via matroid intersection
The lecture was held within the framework of the follow-up workshop to the Hausdorff Trimester Program: Combinatorial Optimization. Abstract: Edmonds characterized digraphs having a packing of k spanning arborescences in terms of connectivity and later in terms of matroid intersection. D
From playlist Follow-Up-Workshop "Combinatorial Optimization"
Pavlo Pylyavskyy: "Algebraic entropy in combinatorial dynamical systems"
Asymptotic Algebraic Combinatorics 2020 "Algebraic entropy in combinatorial dynamical systems" Pavlo Pylyavskyy - University of Minnesota, Twin Cities Abstract: Algebraic entropy was introduced by Bellon and Viallet as a measure of complexity of algebraic systems. Having zero algebraic e
From playlist Asymptotic Algebraic Combinatorics 2020
András Frank: Non TDI Optimization with Supermodular Functions
The notion of total dual integrality proved decisive in combinatorial optimization since it properly captured a phenomenon behind the tractability of weighted optimization problems. For example, we are able to solve not only the maximum cardinality matching (degree-constrained subdigraph,
From playlist HIM Lectures 2015
This lesson introduces graph theory and defines the basic vocabulary used in graph theory. Site: http://mathispower4u.com
From playlist Graph Theory
Graph Theory: 09. Graph Isomorphisms
In this video I provide the definition of what it means for two graphs to be isomorphic. I illustrate this with two isomorphic graphs by giving an isomorphism between them, and conclude by discussing what it means for a mapping to be a bijection. An introduction to Graph Theory by Dr. Sar
From playlist Graph Theory part-2
In this tutorial I explore the concepts of walks, trails, paths, cycles, and the connected graph.
From playlist Introducing graph theory
Stanford Seminar - Towards Robust Human-Robot Interaction: A Quality Diversity Approach
Stefanos Nikolaidis is an Assistant Professor in computer science at the University of Southern California. This talk was given on March 4, 2022. The growth of scale and complexity of interactions between humans and robots highlights the need for new computational methods to automaticall
From playlist Stanford AA289 - Robotics and Autonomous Systems Seminar