James Oxley: A matroid extension result
Abstract: Let (A,B) be a 3-separation in a matroid M. If M is representable, then, in the underlying projective space, there is a line where the subspaces spanned by A and B meet, and M can be extended by adding elements from this line. In general, Geelen, Gerards, and Whittle proved that
From playlist Combinatorics
9 3 Random Contraction Algorithm 9 min
From playlist Algorithms 1
Yusuke Kobayashi: A weighted linear matroid parity algorithm
The lecture was held within the framework of the follow-up workshop to the Hausdorff Trimester Program: Combinatorial Optimization. Abstract: The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so gener
From playlist Follow-Up-Workshop "Combinatorial Optimization"
Limit shapes and their analytic parameterizations – Richard Kenyon – ICM2018
Combinatorics | Probability and Statistics Invited Lecture 13.11 | 12.15 Limit shapes and their analytic parameterizations Richard Kenyon Abstract: A “limit shape” is a form of the law of large numbers, and happens when a large random system, typically consisting of many interacting part
From playlist Combinatorics
Steffen Borgwardt: The role of partition polytopes in data analysis
The field of optimization, and polyhedral theory in particular, provides a powerful point of view on common tasks in data analysis. In this talk, we highlight the role of the so-called partition polytopes and their studies in clustering and classification. The geometric properties of parti
From playlist Workshop: Tropical geometry and the geometry of linear programming
Gyula Pap: Linear matroid matching in the oracle model
Gyula Pap: Linear matroid matching in the oracle model Linear matroid matching is understood as a special case of matroid matching when the matroid is given with a matrix representation. However, for certain examples of linear matroids, the matrix representation is not given, and actuall
From playlist HIM Lectures 2015
Yuval Filmus: Monotone Submodular Optimization over a Matroid
We consider the NP-hard problem of maximizing a monotone submodular function over a matroid constraint. Vondrak's continuous greedy algorithm achieves the best possible approximation ratio 1-1/e using continuous methods. Can the same be accomplished combinatorially? We show that this is ar
From playlist HIM Lectures 2015
Clustering is the process of grouping a set of data given a certain criterion. In this way it is possible to define subgroups of data, called clusters, that share common characteristics. Determining the internal structure of the data is important in exploratory data analysis, but is also u
From playlist “How To” with MATLAB and Simulink
Nonlinear algebra, Lecture 13: "Polytopes and Matroids ", by Mateusz Michalek
This is the thirteenth lecture in the IMPRS Ringvorlesung, the advanced graduate course at the Max Planck Institute for Mathematics in the Sciences.
From playlist IMPRS Ringvorlesung - Introduction to Nonlinear Algebra
Jesus De Loera: Tverberg-type theorems with altered nerves
Abstract: The classical Tverberg's theorem says that a set with sufficiently many points in R^d can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is b
From playlist Combinatorics
Mathematica Tutorial 20 - Limits of Functions and Sequences
In this Mathematica tutorial you will learn about limits of functions and sequences. *** SUBSCRIBE FOR MORE VIDEOS *** Never miss a daily video about Mathematics and Mathematica. Subscribe: https://www.youtube.com/channel/UCbqxG8H7jg-I0XAMzUdS1Xw?sub_confirmation=1
From playlist Mathematica Tutorials
Lauren Williams - Combinatorics of the amplituhedron
The amplituhedron is the image of the positive Grassmannian under a map in- duced by a totally positive matrix. It was introduced by Arkani-Hamed and Trnka to compute scattering amplitudes in N=4 super Yang Mills. I’ll give a gentle introduction to the amplituhedron, surveying its connecti
From playlist Combinatorics and Arithmetic for Physics: Special Days 2022
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
Network Analysis. Lecture 9. Graph partitioning algorithms
Graph density. Graph pertitioning. Min cut, ratio cut, normalized and quotient cuts metrics. Spectral graph partitioning (normalized cut). Direct (spectral) modularity maximization. Multilevel recursive partitioning Lecture slides: http://www.leonidzhukov.net/hse/2015/networks/lectures/le
From playlist Structural Analysis and Visualization of Networks.
Nexus Trimester - František Matúš (Institute of Information Theory and Automation) 2/3
Entropy region and convolution František Matúš (Institute of Information Theory and Automation) February 19, 2016 Abstract: The entropy region is constructed from vectors of random variables by collecting Shannon entropies of all subvectors. We will review results on its shape using poly
From playlist Nexus Trimester - 2016 - Fundamental Inequalities and Lower Bounds Theme
Kevin Hendrey - Obstructions to bounded branch-depth in matroids (CMSA Combinatorics Seminar)
Kevin Hendrey (Institute for Basic Science) presents “Obstructions to bounded branch-depth in matroids”, 24 November 2020 (CMSA Combinatorics Seminar).
From playlist CMSA Combinatorics Seminar
A video segment from the Coursera MOOC on introductory computer programming with MATLAB by Vanderbilt. Lead instructor: Mike Fitzpatrick. Check out the companion website and textbook: http://cs103.net
From playlist Vanderbilt: Introduction to Computer Programming with MATLAB (CosmoLearning Computer Programming)
Seminar on Applied Geometry and Algebra (SIAM SAGA): Jan Draisma
Date: Tuesday, April 13 at 11:00am Eastern time zone Speaker: Jan Draisma, Bern University / Eindhoven University of Technology Title: Infinite-dimensional geometry with symmetry Abstract: Most theorems in finite-dimensional algebraic geometry break down in infinite dimensions---for ins
From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)
Strongly log concave polynomials...Bases of Matroids - Shayan Oveis Gharan
More videos on http://video.ias.edu
From playlist Mathematics