English
Related papers

Related papers: On the Quotient-Lift Matroid Relation

200 papers

In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…

Combinatorics · Mathematics 2007-05-23 Massimiliano Lunelli , Antonio Laface

We prove that a compact simply connected manifold $M$ with a variationally complete $G$-action satisfying certain mild conditions (e.g. trivial principal isotropy, or simply connected principal orbits) is rationally elliptic if and only if…

Differential Geometry · Mathematics 2025-12-30 Ricardo Mendes , Alessandro Minuzzo , Marco Radeschi

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

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

Given an orthogonal representation of a compact group, we show that any element of the connected component of the isometry group of the orbit space lifts to an equivariant isometry of the original Euclidean space. Corollaries include a…

Metric Geometry · Mathematics 2021-09-17 Ricardo A. E. Mendes

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

Combinatorics · Mathematics 2015-03-09 Heping Zhang , Dewu Yang , Haiyuan Yao

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T;R) of V(R) such that T is the sum of the topes of Q(T;R). If…

Combinatorics · Mathematics 2017-03-14 Andrey O. Matveev

Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…

History and Overview · Mathematics 2022-07-29 Jun Lu

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

An element $e$ of a $3$-connected matroid $M$ is elastic if ${\rm si}(M/e)$, the simplification of $M/e$, and ${\rm co}(M\backslash e)$, the cosimplification of $M\backslash e$, are both $3$-connected. It was recently shown that if…

Combinatorics · Mathematics 2022-07-20 George Drummond , Charles Semple

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

We extend the splitting operation from binary matroids (Raghunathan et al., 1998) to $p$- matroids, where $p$-matroids refer to matroids representable over $GF(p).$ We also characterize circuits, bases, and independent sets of the resulting…

Combinatorics · Mathematics 2025-07-15 Prashant Malavadkar , Uday Jagadale , Sachin Gunjal

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

Combinatorics · Mathematics 2025-09-26 Minho Cho , Seunghun Lee , Frédéric Meunier

For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…

Combinatorics · Mathematics 2023-12-13 Emeric Gioan

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Discrete Mathematics · Computer Science 2017-02-08 Rohit Gurjar , Nisheeth K. Vishnoi

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

Combinatorics · Mathematics 2017-12-13 João Paulo Costalonga

This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…

Combinatorics · Mathematics 2020-05-25 Relinde Jurrius , Ruud Pellikaan

This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider $p$-entropic matroids, for which the random variables each have support of…

Information Theory · Computer Science 2019-10-23 Emmanuel Abbe , Sophie Spirkl
‹ Prev 1 4 5 6 7 8 10 Next ›