English
Related papers

Related papers: On the Quotient-Lift Matroid Relation

200 papers

Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…

Combinatorics · Mathematics 2018-01-23 Tara Fife , James Oxley

In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…

Combinatorics · Mathematics 2016-12-12 Joel Brewster Lewis , Victor Reiner

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…

Combinatorics · Mathematics 2012-03-26 Kenji Kashiwabara

Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids…

Combinatorics · Mathematics 2022-10-07 Santiago Guzmán-Pro , Winfried Hochstättler

We obtain an algorithmic construction of the isotropy lattice for a lifted action of a Lie group $G$ on $TM$ and $T^*M$ based only on the knowledge of $G$ and its action on $M$. Some applications to symplectic geometry are also shown.

Differential Geometry · Mathematics 2025-01-20 Miguel Rodriguez-Olmos

Adding elements to matroids can be fraught with difficulty. In the V\'amos matroid $V_8$, there are four independent sets $X_1,X_2, X_3,$ and $X_4$ such that $(X_1 \cup X_2,X_3 \cup X_4)$ is a $3$-separation while exactly three of the local…

Combinatorics · Mathematics 2018-05-15 James Oxley

An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…

Combinatorics · Mathematics 2019-03-29 Tilman Moeller

A Quillen model structure is presented by an interacting pair of weak factorization systems. We prove that in the world of locally presentable categories, any weak factorization system with accessible functorial factorizations can be lifted…

Category Theory · Mathematics 2022-05-23 Richard Garner , Magdalena Kedziorek , Emily Riehl

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

Combinatorics · Mathematics 2024-11-21 Jagdeep Singh , Vaidy Sivaraman

We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…

Combinatorics · Mathematics 2020-12-23 Clas Löfwall

In this note we introduce a sufficient condition for the Orlik-Solomon algebra associated to a matroid M to be l-adic and we prove that this condition is necessary when M is binary (in particular graphic). Moreover, this result cannot be…

Combinatorics · Mathematics 2007-05-23 Raul Cordovil , David Forge

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué

In this work, we consider matroid theory. After presenting three different (but equivalent) definitions of matroids, we mention some of the most important theorems of such theory. In particular, we note that every matroid has a dual matroid…

High Energy Physics - Theory · Physics 2014-11-18 J. A. Nieto

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We show that every element of $\mathrm{SL}_{n}(\mathbb{Z}/q\mathbb{Z})$ can be lifted to an element of $\mathrm{SL}_{n}(\mathbb{Z})$ of norm at most $Cq^2\log q$, while there exists an element such that every lift of it is of norm at least…

Number Theory · Mathematics 2026-03-26 Amitay Kamber , Péter P. Varjú

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Combinatorics · Mathematics 2025-07-10 Galen Dorpalen-Barry , Dan Dugger , Nicholas Proudfoot

This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].

Combinatorics · Mathematics 2017-11-23 Jon Henry Sanders

Recently, the relationship between matroids and generalized rough sets based on relations has been studied from the viewpoint of linear independence of matrices. In this paper, we reveal more relationships by the predecessor and successor…

Artificial Intelligence · Computer Science 2012-11-30 Yanfang Liu , William Zhu