English
Related papers

Related papers: Matroids arising from algebraic shifting

200 papers

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

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…

History and Overview · Mathematics 2025-08-19 James Cruickshank , Bill Jackson , Tibor Jordán , Shin-ichi Tanigawa

We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.

Combinatorics · Mathematics 2011-06-07 Kolja Knauer , Juan Jose Montellano-Ballesteros , Ricardo Strausz

In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal…

Combinatorics · Mathematics 2025-01-22 James Dylan Douthitt , James Oxley

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Combinatorics · Mathematics 2015-03-17 R. Askanazi , S. Chmutov , C. Estill , J. Michel , P. Stollenwerk

We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…

Combinatorics · Mathematics 2026-03-17 Dániel Garamvölgyi , Bill Jackson , Tibor Jordán , Soma Villányi

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…

Artificial Intelligence · Computer Science 2012-09-26 Lirun Su , William Zhu

A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…

Combinatorics · Mathematics 2023-01-06 Shital D. Solanki , Ganesh Mundhe , S. B. Dhotre

Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the…

Metric Geometry · Mathematics 2017-09-27 Derek Kitson , Bernd Schulze

Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…

Commutative Algebra · Mathematics 2026-02-18 Zvi Rosen , Jessica Sidman , Louis Theran

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Combinatorics · Mathematics 2014-06-17 Reinhard Diestel , Sang-il Oum

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are regarded as disjoint unions of two subsets of the ground set {1,...,t} of the…

Combinatorics · Mathematics 2020-08-25 Andrey O. Matveev

We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…

Combinatorics · Mathematics 2025-09-01 Ethan Partida

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…

Artificial Intelligence · Computer Science 2013-11-06 Bin Yang , Hong Zhao , William Zhu

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…

Combinatorics · Mathematics 2015-03-13 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…

Combinatorics · Mathematics 2026-03-20 Kyle Binder

A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…

Operator Algebras · Mathematics 2007-05-23 S. C. Power

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Combinatorics · Mathematics 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius
‹ Prev 1 3 4 5 6 7 10 Next ›