We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their minors.
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 significantly differ from bicircular matroids. Recently, it was proved that all cosimple lattice path matroids have positive double circuits, while it was shown that there is a large class of cosimple bicircular matroids with no positive double circuits. These observations support Bonin and de Miers' claim. Finally, Sivaraman and Slilaty suggested studying t…
Several matroids can be defined on the edge set of a graph. Although historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s gives a characterization of graphs whose bicircular matroids are graphic. We give a characterization of graphs whose bicircular matroids are signed-graphic.
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid $L(G)$ are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are minimal with respect to this property. For each cycle $C$ of $G$, since $L(G)/C$ is graphic and most graphic matroids are not bicircular lift, the class of bicircular lift matroids is not minor-closed. In this paper, we prove that the class of matroids that are graphic or bicircular lift has a finite list of excluded minors.
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are minimal with respect to this property. The main result of this paper is a characterization of when two graphs give rise to the same bicircular lift matoid, which answers a question proposed by Irene Pivotto. In particular, aside from some appropriately defined "small" graphs, two graphs have the same bicircular lift matroid if and only if they are $2$-isomorph…
We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not depend on an excluded-minor characterisation.
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mathcal{O}$ is an $M(K_4)$-free oriented matroid, then $\mathcal{O}$ admits a NZ $3$-coflow, i.e., it is $3$-colourable in the sense of Hochstättler-Nešetřil. The class of gammoids is a class of $M(K_4)$-free orientable matroids and it is the minimal minor-closed class that contains all transversal matroids. Towards proving the previous statement for the class of gammoids, Goddyn, Hochstättler, and Neudauer conjectured that every gammoid has a positive coline (equivalently, a positive double circui…
We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.
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]
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 are precisely the duals of representable matroids (those arising from vector spaces). We also show that the class of tame thin sums matroids is closed under duality and under taking minors, by giving a new characterisation of the matroids in this class. Finally, we show that all the matroids naturally associated to an infinite graph are tame thin sums matroids…
Hlineny's Theorem shows that any sentence in the monadic second-order logic of matroids can be tested in polynomial time, when the input is limited to a class of F-representable matroids with bounded branch-width (where F is a finite field). If each matroid in a class can be decomposed by a subcubic tree in such a way that only a bounded amount of information flows across displayed separations, then the class has bounded decomposition-width. We introduce the pigeonhole property for classes of matroids: if every subclass with bounded branch-width also has bounded decomposition-width, then the c…
We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on the matroid Tutte polynomial. This polynomial satisfies a deletion-contraction recursion. We explore this notion of duality for greedoids, antimatroids and demi-matroids, proving that matroids correspond precisely to objects that are simultaneously greedoids and "dual" greedoids.
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets. Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversely, we show that carving width is dual to edge-tangles. For matroids we obtain a duality theorem for tree-width. Our results can be used to derive short proofs of all the classical duality theorems for wi…
Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an infinite family of counterexamples for the conjecture and showed that essentially these are the only counterexamples. This is also obtained independently by Chumutov and Vignes-Tourneret and they posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would make sence for general delta-matroids. In thi…
This sequel to our paper (Infinite gammoids, 2014) considers minors and duals of infinite gammoids. We prove that a class of gammoids definable by digraphs not containing a certain type of substructure, called an outgoing comb, is minor-closed. Also, we prove that finite-rank minors of gammoids are gammoids. Furthermore, the topological gammoids introduced by Carmesin (Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, 2014) are proved to coincide, as matroids, with the finitary gammoids. A corollary is that topological gammoids are minor-closed. It is a well-kno…
We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits, and the edges of T correspond to certain nested 2-separations of M. These decompositions are invariant under duality.
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of checkerboard graphs is the same as the equivalence relation defined by 2-isomorphisms of checkerboard graphs.
Fix a principal ideal domain $k$. In this article we associate to a (weighted) matroid $M$ a quasi-hereditary algebra $R(M)$ defined over $k$ such that matroid duality corresponds to Ringel duality of quasi-hereditary algebras. The representation theory of these algebras is related to work of Schechtman-Varchenko and Brylawski-Varchenko. In characteristic zero, our algebras are also closely related to work of Kook-Reiner-Stanton and Denham.
We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte's representability criterion to this new class, and we study the generator matrices of the chain groups. An example shows that the class of matroids representable over a skew partial field properly contains the class of matroids representable over a skew field. Next, we show that every multilinear representation of a ma…
The class of simplicial complexes representing triangulations and subdivisions of Lawrence polytopes is closed under Alexander duality. This gives a new geometric model for oriented matroid duality.
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being closed under duality and taking minors. Furthermore, these matroids proved to be useful in giving exact asymptotic bounds for the dimension of the Dressian, and also implied new results on the rays of the tropical Grassmannians. In the present paper, we introduce the notion of elementary split matroids, a subclass of split matroids that contains all connected…
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 motivation for studying q-matroids by showing that a rank metric code gives a q-matroid.
We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are associated to linear codes, our definitions coincide with those for codes. Thus our Wei duality is a generalization of that for linear codes given by Schaathun. In the last part of the paper we show how some important chains of cycles of the matroids appearing, correspond to chains of component maps of minimal resolutions of the independence complex of the correspon…
It follows by Bixby's Lemma that if $e$ is an element of a $3$-connected matroid $M$, then either ${\rm co}(M\delete e)$, the cosimplification of $M\delete e$, or ${\rm si}(M/e)$, the simplification of $M/e$, is $3$-connected. A natural question to ask is whether $M$ has an element $e$ such that both ${\rm co}(M\delete e)$ and ${\rm si}(M/e)$ are $3$-connected. Calling such an element "elastic", in this paper we show that if $|E(M)|\ge 4$, then $M$ has at least four elastic elements provided $M$ has no $4$-element fans and, up to duality, $M$ has no $3$-separating set $S$ that is the disjoint …
We study a particular graded ring structure on the set of all loopfree matroids on a fixed labeled ground set, which occurs naturally in tropical geometry. The product is given by matroid intersection and the additive structure is defined by assigning to each matroid the indicator vector of its chains of flats. We show that this ring is generated in corank one, more precisely that any matroid can be written as a linear combination of products of corank one matroids. Moreover, we prove that a basis for the graded part of rank r matroids is given by the set of nested matroids and that the total …
Let $M$ be a $3$-connected binary matroid; $M$ is internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a $4$-element fan. Assume $M$ is internally $4$-connected and that neither $M$ nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let $N$ be an internally $4$-connected proper minor of $M$. Our aim is to show that $M$ has a proper internally $4$-connected minor with an $N$-minor that can be obtained from $M$ either by removing at most f…
Let $M$ be a $3$-connected binary matroid; $M$ is called internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a $4$-element fan. Assume $M$ is internally $4$-connected and that neither $M$ nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let $N$ be an internally $4$-connected proper minor of $M$. Our aim is to show that $M$ has a proper internally $4$-connected minor with an $N$-minor that can be obtained from $M$ either by removing at…
Projection maps which appear in the theory of buildings and oriented matroids are closely related to the notion of shellability. This was first observed by Bj{ö}rner. In this paper, we give an axiomatic treatment of either concept and show their equivalence. We also axiomatize duality in this setting. As applications of these ideas, we prove a duality theorem on buildings and give a geometric interpretation of the flag $h$ vector. The former may be regarded as a $q$-analogue of the Dehn-Sommerville equations. We also briefly discuss the connection with the random walks introduced by Bidigare, …
Singular Hodge theory for combinatorial geometries
University of Massachusetts, Amherst(马萨诸塞大学阿默斯特分校);Princeton University(普林斯顿大学);Korea Institute for Advanced Study(韩国高等研究院);North Carolina State University(北卡罗来纳州立大学);University of Oregon(俄勒冈大学);University of Wisconsin-Madison(威斯康星大学麦迪逊分校)