Related papers: Matroids with nine elements
Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several other closely related classes of…
Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…
Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A breakthrough result of Bernstein, Holm, and Rotenberg…
In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…
Discussion of the designation of multiple-star components leads to a conclusion that, apart from components, we need to designate systems and centers-of-mass. The hierarchy is coded then by simple links to parent. This system is adopted in…
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…
We combine some known results and techniques with new ones to show that there exists a non-algebraic, multi-linear matroid. This answers an open question by Matus (Discrete Mathematics 1999), and an open question by Pendavingh and van Zwam…
The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of…
Matroids are combinatorial abstractions of independence, a ubiquitous notion that pervades many branches of mathematics. June Huh and his collaborators recently made spectacular breakthroughs by developing a Hodge theory of matroids that…
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…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…
In this paper, we present some applications of quaternions and octonions. We present the real matrix representations for complex octonions and some of their properties which can be used in computations where these elements are involved.…
In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…
A celebrated result of Seymour is that all regular matroids are built up from graphic matroids, cographic matroids, and a specific 10 element rank 5 matroid called $R_{10}$. In this article, we give a simple description of chip-firing on…
Motivated by recently discovered connections between matroid depth measures and block-structured integer programming [ICALP 2020, 2022], we undertake a systematic study of recursive depth parameters for matrices and matroids, aiming to…
We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We show that if the matroid is tame then this local information…
Subject to announced results by Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids.
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…