English
Related papers

Related papers: Taking minors without splitting tangles

200 papers

Halin proved that every minimally $k$-connected graph has a vertex of degree $k$. More generally, does every minimally vertically $k$-connected matroid have a $k$-element cocircuit? Results of Murty and Wong give an affirmative answer when…

Combinatorics · Mathematics 2022-05-27 James Oxley , Zach Walsh

Let AG(3,2)xU(1,1) denote the binary matroid obtained from the direct sum of AG(3,2) and a coloop by completing the 3-point lines between every element in AG(3,2) and the coloop. We prove that every internally 4-connected binary matroid…

Combinatorics · Mathematics 2012-02-20 Dillon Mayhew , Gordon Royle

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

Combinatorics · Mathematics 2019-10-15 Laszlo Csirmaz

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

Combinatorics · Mathematics 2015-09-02 João Paulo Costalonga

Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…

Combinatorics · Mathematics 2021-04-21 Lorenzo Vecchi

Solenoids induced by split sequences are introduced, as the inverse limit object of a sequence of fold maps. The topology of a solenoid is explored, and it is established that solenoids have naturally arising singular foliated structures.…

Dynamical Systems · Mathematics 2025-04-09 Sarasi Jayasekara

We prove that every paving matroid that is an excluded minor of interval positroids can be reduced to one of three fundamental families of excluded minors of interval positroids by relaxing dependent hyperplanes. Using this result, we…

Combinatorics · Mathematics 2023-12-07 Hyungju Park

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…

Combinatorics · Mathematics 2017-11-09 Reinhard Diestel , Geoff Whittle

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

Combinatorics · Mathematics 2026-01-08 Or Raz

We prove that the complement of a toric arrangement has the homotopy type of a minimal CW complex. As a corollary we obtain that the integer cohomology of these spaces is torsion free. We use Discrete Morse Theory, providing a sequence of…

Combinatorics · Mathematics 2013-03-27 Giacomo d'Antonio , Emanuele Delucchi

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Peter Nelson

We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the…

Data Structures and Algorithms · Computer Science 2021-12-23 Gwenaël Joret , Adrian Vetta

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

Combinatorics · Mathematics 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez , David Forge

In this paper we describe splitting methods for solving Levitron, which is motivated to simulate magnetostatic traps of neutral atoms or ion traps. The idea is to levitate a magnetic spinning top in the air repelled by a base magnet. The…

Mathematical Physics · Physics 2012-01-10 Juergen Geiser , Karl Lueskow

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

We study the representability problem for torsion-free arithmetic matroids. By using a new operation called "reduction" and a "signed Hermite normal form", we provide and implement an algorithm to compute all the representations, up to…

Combinatorics · Mathematics 2023-03-08 Roberto Pagaria , Giovanni Paolini

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan