English
Related papers

Related papers: Strong Splitter Theorem

200 papers

Spikes are an important class of 3-connected matroids. For an integer $r\geq 3$, there is a unique binary r-spike denoted by $Z_{r}$. When a circuit-hyperplane of $Z_{r}$ is relaxed, we obtain another spike and repeating this procedure will…

Combinatorics · Mathematics 2018-10-22 Vahid Ghorbani , Ghodratollah Azadi , Habib Azanchiler

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge Luis Ramírez Alfonsín

We map out possible extensions of the MSSM in the context of type II string theory. We systematically investigate three-stack and four-stack quivers which realize the MSSM spectrum with the addition of a single MSSM singlet S with an…

High Energy Physics - Theory · Physics 2014-11-21 Mirjam Cvetič , James Halverson , Paul Langacker

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Combinatorics · Mathematics 2018-11-22 Sammy Luo

The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…

Combinatorics · Mathematics 2023-02-06 Kristóf Bérczi , Tamás Schwarcz

We give an excluded-minor characterization for the class of matroids M in which M\e or M/e is binary for all e in E(M). This class is closely related to the class of matroids in which every member is binary or can be obtained from a binary…

Combinatorics · Mathematics 2013-07-30 James Oxley , Jesse Taylor

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…

The famous Haken-Kneser-Milnor theorem states that every 3-manifold can be expressed in a unique way as a connected sum of prime 3-manifolds. The analogous statement for 3-orbifolds has been part of the folklore for several years, and it…

Geometric Topology · Mathematics 2015-06-26 Carlo Petronio

In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4}$ or $F_7$ or $M(K_5)$ as a minor.

Combinatorics · Mathematics 2014-12-17 Boris Albar , Daniel Gonçalves , Jorge L. Ramírez Alfonsín

We investigate the set of excluded minors of connectivity 2 for the class of frame matroids. We exhibit a list $\mathcal{E}$ of 18 such matroids, and show that if $N$ is such an excluded minor, then either $N \in \mathcal{E}$ or $N$ is a…

Combinatorics · Mathematics 2016-11-08 Matt DeVos , Daryl Funk , Irene Pivotto

The purpose of this paper is to produce restrictions on fundamental groups of manifolds admitting good complexifications by proving the following Cheeger-Gromoll type splitting theorem: Any closed manifold $M$ admitting a good…

Geometric Topology · Mathematics 2016-12-30 Indranil Biswas , Mahan Mj , A. J. Parameswaran

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Combinatorics · Mathematics 2013-10-01 J. A. De Loera , J. Lee , S. Margulies , J. Miller

This document is a blueprint for the formalization in Lean of the structural theory of regular matroids underlying Seymour's decomposition theorem. We present a modular account of regularity via totally unimodular representations, show that…

Combinatorics · Mathematics 2026-01-06 Ivan Sergeev , Martin Dvorak , Cameron Rampell , Mark Sandey , Pietro Monticone

We consider two types of matroids defined on the edge set of a graph $G$: count matroids ${\cal M}_{k,\ell}(G)$, in which independence is defined by a sparsity count involving the parameters $k$ and $\ell$, and the (three-dimensional…

Combinatorics · Mathematics 2024-01-11 Dániel Garamvölgyi , Tibor Jordán , Csaba Király

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

Combinatorics · Mathematics 2024-08-20 Rudi Pendavingh

A simple one-dimensional mechanical model is proposed for splitting instability in swollen membranes. The splitting instability occurs by ring constriction. The bifurcation can be both subcritical and supercritical, depending on the…

Soft Condensed Matter · Physics 2015-06-18 Hidetsugu Sakaguchi , Satomi Maeyama

We investigate the properties of a system of semi-diluted polymers in the presence of charged groups and counter-ions, by means of self-consistent field theory. We study a system of polyelectrolyte chains grafted to a similarly, as well as…

Soft Condensed Matter · Physics 2015-05-19 Gabriele Migliorini

A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected…

Combinatorics · Mathematics 2026-05-14 Sayantani Bhattacharya , John David Clifton , Zach Walsh

Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam
‹ Prev 1 4 5 6 7 8 10 Next ›