Matroid partitioning

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"

Partitions (#MegaFavNumbers)

A brief introduction to partitions and combinatorics. This video is part of the #MegaFavNumbers project. More videos can be found here: https://www.youtube.com/playlist?list=PLar4u0v66vIodqt3KSZPsYyuULD5meoAo

From playlist MegaFavNumbers

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

Matrices in MATLAB | Lecture 7 | Numerical Methods for Engineers

How to construct and operate with matrices in MATLAB. Join me on Coursera: https://www.coursera.org/learn/numerical-methods-engineers Lecture notes at http://www.math.ust.hk/~machas/numerical-methods-for-engineers.pdf Subscribe to my channel: http://www.youtube.com/user/jchasnov?sub_con

From playlist Numerical Methods for Engineers

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.

Working with Matrices in Matlab

This tutorial shows how to define and manipulate matrices in Matlab. Topics and timestamps: 0:00 – Introduction 1:19 – Defining a matrix 6:59 – Matrix multiplication (both standard and elementwise) 14:19 – Extracting submatrices 18:16 – Transpose 19:12 – Concatenation 21:57 – Creating l

From playlist Working with Matlab

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

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

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

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

Lesson 2.6: Arithmetic Part 2

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)

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

MATLAB workspaces, stacks, and stepping-into functions

This is part of an online course on MATLAB. The course includes 5+ hours of video lectures, pdf readers, exercises, and solutions. No prior experience with MATLAB is necessary. The goal is for you to learn high-level, transferrable skills that will help you become a better programmer in a

From playlist MATLAB programming, debugging, and style

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

Anja Fischer: Polynomial Matroid Optimisation Problems

n this talk we consider polynomial matroid optimisation problems with some non-linear monomials in the objective function. The monomials are linearised and we study the corresponding polytopes. Extending results of Edmonds we present complete descriptions for the linearised polytopes for t

From playlist HIM Lectures: Trimester Program "Combinatorial Optimization"

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)

Jørgen Bang-Jensen: Antistrong digraphs

Jørgen Bang-Jensen: Antistrong digraphs An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that one can decide in line

From playlist HIM Lectures 2015

MATLAB Basics: Get The Most Out of MATLAB

In this livestream, Heather Gorr and Elsie Eigerman will be walking through the fundamentals of programming with MATLAB. This isn’t just for beginners; we’ll show you the latest and greatest tips and tricks to help you get the most out of MATLAB. We’ll also walk-through core concepts for t

From playlist MATLAB and Simulink Livestreams