Related papers: Matroid intersection, base packing and base coveri…

The matroid-based valuation conjecture of Ostrovsky and Paes Leme states that all gross substitutes valuations on $n$ items can be produced from merging and endowments of weighted ranks of matroids defined on at most $m(n)$ items. We show…

Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…

We prove a KKM-type theorem for matroid colored families of set coverings of a polytope. This generalizes Gale's colorful KKM theorem as well as recent sparse-colorful variants by Sober\'on, and McGinnis and Zerbib.

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…

We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate…

Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them remain undiscovered.…

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

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 show that, under suitable hypotheses, the foundation of a generalized parallel connection of matroids is the relative tensor product of the foundations. Using this result, we show that the foundation of a 2-sum of matroids is the…

We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…

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…

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

This thesis presents new applications of Gale duality to the study of polytopes, point configurations and oriented matroids with extremal combinatorial properties. The first part of the thesis explores construction techniques for neighborly…

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for…

Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common…