Class Of Matroids Research Articles

Simplicial Complexes with Many Facets are Vertex Decomposable

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$, then $\Delta$ is Cohen-Macaulay. We improve this result by showing that these hypotheses imply the stronger condition that $\Delta$ is vertex decomposable. We give examples to show that this bound is optimal, and that the conclusion cannot be strengthened to the class of matroids or shifted complexes. We explore an application to Simon's Conjecture and discuss connections to other results from the literature.

Valuative invariants for large classes of matroids

AbstractWe study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a stressed subset. This framework provides a new combinatorial characterization of the class of (elementary) split matroids. Moreover, it permits to describe an explicit matroid subdivision of a hypersimplex, which, in turn, can be used to write down concrete formulas for the evaluations of any valuative invariant on these matroids. This shows that evaluations on these matroids depend solely on the behavior of the invariant on a tractable subclass of Schubert matroids. We address systematically the consequences of our approach for several invariants. They include the volume and Ehrhart polynomial of base polytopes, the Tutte polynomial, Kazhdan–Lusztig polynomials, the Whitney numbers of the first and second kinds, spectrum polynomials and a generalization of these by Denham, chain polynomials and Speyer's ‐polynomials, as well as Chow rings of matroids and their Hilbert–Poincaré series. The flexibility of this setting allows us to give a unified explanation for several recent results regarding the listed invariants; furthermore, we emphasize it as a powerful computational tool to produce explicit data and concrete examples.

Chordal matroids arising from generalized parallel connections

A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of simple GF(q)-representable matroids that can be built from projective geometries over GF(q) by repeated generalized parallel connections across projective geometries. We show that this class of matroids is closed under induced minors. We characterize the class by its forbidden induced minors; the case when q=2 is distinctive.

Algebraic matroids are almost entropic

Algebraic matroids capture properties of the algebraic dependence among elements of extension fields. Almost entropic matroids have the rank functions arbitrarily well approximated by the entropies of subvectors of random vectors. The former class of matroids is included in the latter. A key argument in the proof is the Lang-Weil bound on the number of points in algebraic varieties.

Partitioning into common independent sets via relaxing strongly base orderability

The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e. when the goal is to decide if two common independent sets suffice or not. Nevertheless, as the problem generalizes several long-standing open questions, identifying tractable cases is of particular interest. Strongly base orderable matroids form a class for which a basis-exchange condition that is much stronger than the standard axiom is met. As a result, several problems that are open for arbitrary matroids can be solved for this class. In particular, Davies and McDiarmid showed that if both matroids are strongly base orderable, then the covering number of their intersection coincides with the maximum of their covering numbers.Motivated by their result, we propose relaxations of strongly base orderability in two directions. First we weaken the basis-exchange condition, which leads to the definition of a new, complete class of matroids with distinguished algorithmic properties. Second, we introduce the notion of covering the circuits of a matroid by a graph, and consider the cases when the graph is (A) 2-regular, or (B) a path. We give an extensive list of results explaining how the proposed relaxations compare to existing conjectures and theorems on coverings by common independent sets.

Purity and Separation for Oriented Matroids

Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to the combinatorics of the double Bruhat cells, and to the totally positive Grassmannian. A key feature, called the purity phenomenon, is that every maximal by inclusion strongly (resp., weakly) separated collection of subsets in [ n ] [n] has the same cardinality. In this paper, we extend these notions and define M \mathcal {M} -separated collections for any oriented matroid M \mathcal {M} . We show that maximal by size M \mathcal {M} -separated collections are in bijection with fine zonotopal tilings (if M \mathcal {M} is a realizable oriented matroid), or with one-element liftings of M \mathcal {M} in general position (for an arbitrary oriented matroid). We introduce the class of pure oriented matroids for which the purity phenomenon holds: an oriented matroid M \mathcal {M} is pure if M \mathcal {M} -separated collections form a pure simplicial complex, i.e., any maximal by inclusion M \mathcal {M} -separated collection is also maximal by size. We pay closer attention to several special classes of oriented matroids: oriented matroids of rank 3 3 , graphical oriented matroids, and uniform oriented matroids. We classify pure oriented matroids in these cases. An oriented matroid of rank 3 3 is pure if and only if it is a positroid (up to reorienting and relabeling its ground set). A graphical oriented matroid is pure if and only if its underlying graph is an outerplanar graph, that is, a subgraph of a triangulation of an n n -gon. We give a simple conjectural characterization of pure oriented matroids by forbidden minors and prove it for the above classes of matroids (rank 3 3 , graphical, uniform).

Bounding Branch-Width

If $(X,Y)$ is a partition of the vertices of a graph $G=(V,E)$ and there are $k$ edges joining vertices in $X$ to vertices in $Y$, then $(X,Y)$ is an edge separation of $G$ of order $k$. The graph $G$ is $(n,k)$-edge connected, if whenever $(X,Y)$ is an edge separation of $G$ of order at most $k$, then either $X$ or $Y$ has at most $n$ elements. We prove that if $G$ is cubic and $(n,k)$-edge connected, then one can find edges to delete so that the resulting graph is $(6n+2,k)$-edge connected. We find an explicit bound on the size of a cubic graph that is minimal in the immersion order with respect to having carving-width $k$. The techniques we use generalise techniques used to prove similar theorems for other structures. In an attempt to develop a unified setting we set up an axiomatic framework to describe certain classes of connectivity functions. We prove a theorem for such classes that gives sufficient conditions to enable a bound on the size of members that are minimal with respect to having branch-width greater than $k$. As well as proving the above mentioned result for edge connectivity in this setting, we prove (known) bounds on the size of excluded minors for the classes of matroids and graphs of branch-width $k$. We also bound the size of a connectivity function that has branch-width greater than $k$ and is minimal with respect to an operation known as elision.

Tree Automata and Pigeonhole Classes of Matroids: II

Let $\psi$ be a sentence in the counting monadic second-order logic of matroids and let F be a finite field. Hlineny's Theorem says that we can test whether F-representable matroids satisfy $\psi$ using an algorithm that is fixed-parameter tractable with respect to branch-width. In a previous paper we proved there is a similar fixed-parameter tractable algorithm that can test the members of any efficiently pigeonhole class. In this sequel we apply results from the first paper and thereby extend Hlineny's Theorem to the classes of fundamental transversal matroids, lattice path matroids, bicircular matroids, and H-gain-graphic matroids, when H is a finite group. As a consequence, we can obtain a new proof of Courcelle's Theorem.

Tautological classes of matroids

Tautological classes of matroids

Stellahedral geometry of matroids

Abstract We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety and show that valuative, homological and numerical equivalence relations for matroids coincide. We establish a new log-concavity result for the Tutte polynomial of a matroid, answering a question of Wagner and Shapiro–Smirnov–Vaintrob on Postnikov–Shapiro algebras, and calculate the Chern–Schwartz–MacPherson classes of matroid Schubert cells. The central construction is the ‘augmented tautological classes of matroids’, modeled after certain toric vector bundles on the stellahedral toric variety.

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field F, the list needs to contain only finitely many F-representable matroids, due to the well-quasi-ordering of F-representable matroids of bounded branch-width under taking matroid minors [J.F. Geelen, A.M.H. Gerards, and G. Whittle (2002)]. But this proof is non-constructive and does not provide any algorithm for computing these F-representable excluded minors in general.We consider the class of matroids of path-width at most k for fixed k. We prove that for a finite field F, every F-representable excluded minor for the class of matroids of path-width at most k has at most 2|F|O(k2) elements. We can therefore compute, for any integer k and a fixed finite field F, the set of F-representable excluded minors for the class of matroids of path-width k, and this gives as a corollary a polynomial-time algorithm for checking whether the path-width of an F-represented matroid is at most k. We also prove that every excluded pivot-minor for the class of graphs having linear rank-width at most k has at most 22O(k2) vertices, which also results in a similar algorithmic consequence for linear rank-width of graphs.

The Merino–Welsh Conjecture for Split Matroids

In 1999, Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article, we show that the conjecture generalized to matroids holds for the large class of all split matroids by exploiting the structure of their lattice of cyclic flats. This class of matroids strictly contains all paving and copaving matroids.

On the structure of triangle-free 3-connected matroids

Let N be an arbitrary class of matroids closed under isomorphism. For a positive integer k, we say that M∈N is k-minor-irreducible if M has no minor N∈N such that 1≤|E(M)|−|E(N)|≤k. Tutte's Wheels and Whirls Theorem establish that, up to isomorphism, there are only two families of 1-minor-irreducible matroids in the class of 3-connected matroids. More recently, Lemos classified the 3-minor-irreducible matroids with at least 14 elements in the class of triangle-free 3-connected matroids. Here we prove a local characterization for the 2-minor-irreducible matroids with at least 11 elements in the class of triangle-free 3-connected matroids. This local characterization is used to establish two new families of 2-minor-irreducible matroids in this class.

Matroids are not Ehrhart positive

In this article we disprove the conjectures asserting the positivity of the coefficients of the Ehrhart polynomial of matroid polytopes by De Loera, Haws and Köppe (2007) and of generalized permutohedra by Castillo and Liu (2015). We prove constructively that for every n≥19 there exist connected matroids on n elements that are not Ehrhart positive. Also, we prove that for every k≥3 there exist connected matroids of rank k that are not Ehrhart positive. Our proofs rely on our previous results on the geometric interpretation of the operation of circuit-hyperplane relaxation and our formulas for the Ehrhart polynomials of hypersimplices and minimal matroids. This allows us to give a precise expression for the Ehrhart polynomials of all sparse paving matroids, a class of matroids which is conjectured to be predominant and which contains the counterexamples arising from our construction.

Tree Automata and Pigeonhole Classes of Matroids: I

Hliněný’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 {mathbb {F}}-representable matroids with bounded branch-width (where {mathbb {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 class is pigeonhole. An efficiently pigeonhole class has a stronger property, involving an efficiently-computable equivalence relation on subsets of the ground set. We show that Hliněný’s Theorem extends to any efficiently pigeonhole class. In a sequel paper, we use these ideas to extend Hliněný’s Theorem to the classes of fundamental transversal matroids, lattice path matroids, bicircular matroids, and H-gain-graphic matroids, where H is any finite group. We also give a characterisation of the families of hypergraphs that can be described via tree automata: a family is defined by a tree automaton if and only if it has bounded decomposition-width. Furthermore, we show that if a class of matroids has the pigeonhole property, and can be defined in monadic second-order logic, then any subclass with bounded branch-width has a decidable monadic second-order theory.

Quotients of Uniform Positroids

Two matroids $M$ and $N$ are said to be concordant if there is a strong map from $N$ to $M$. This also can be stated by saying that each circuit of $N$ is a union of circuits of $M$. In this paper, we consider a class of matroids called positroids, introduced by Postnikov, and utilize their combinatorics to determine concordance among some of them.
 More precisely, given a uniform positroid, we give a purely combinatorial characterization of a family of positroids that is concordant with it. We do this by means of their associated decorated permutations. As a byproduct of our work, we describe completely the collection of circuits of this particular subset of positroids.

Biconed Graphs, Weighted Forests, and $h$-Vectors of Matroid Complexes


 
 
 A well-known conjecture of Richard Stanley posits that the $h$-vector of the independence complex of a matroid is a pure ${\mathcal O}$-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is a graph with two specified 'coning vertices', such that every vertex of the graph is connected to at least one coning vertex. The class of biconed graphs includes coned graphs, Ferrers graphs, and complete multipartite graphs. We study the $h$-vectors of graphic matroids arising from biconed graphs, providing a combinatorial interpretation of their entries in terms of '$2$-weighted forests' of the underlying graph. This generalizes constructions of Kook and Lee who studied the Möbius coinvariant (the last nonzero entry of the $h$-vector) of graphic matroids of complete bipartite graphs. We show that allowing for partially $2$-weighted forests gives rise to a pure multicomplex whose face count recovers the $h$-vector, establishing Stanley's conjecture for this class of matroids. We also discuss how our constructions relate to a combinatorial strengthening of Stanley's Conjecture (due to Klee and Samper) for this class of matroids.
 
 

A New Description of Transversal Matroids Through Rough Set Approach

Matroid theory is a useful tool for the combinatorial optimization issue in data mining, machine learning and knowledge discovery. Recently, combining matroid theory with rough sets is becoming interesting. In this paper, rough set approaches are used to investigate an important class of matroids, transversal matroids. We first extend the concept of upper approximation number functions in rough set theory and propose the notion of generalized upper approximation number functions on a set system. By means of the new notion, we give some necessary and sufficient conditions for a subset to be a partial transversal of a set system. Furthermore, we obtain a new description of a transversal matroid by the generalized upper approximation number function. We show that a transversal matroid can be induced by the generalized upper approximation number function which can be decomposed into the sum of some elementary generalized upper approximation number functions. Conversely, we also prove that a generalized upper approximation number function can induce a transversal matroid. Finally, we apply the generalized upper approximation number function to study the relationship among transversal matroids.

Dual Pairs of Matroids with Coefficients in Finitary Fuzzy Rings of Arbitrary Rank

Infinite matroids have been defined by Reinhard Diestel and coauthors in such a way that this class is (together with the finite matroids) closed under dualization and taking minors. On the other hand, Andreas Dress introduced a theory of matroids with coefficients in a fuzzy ring which is – from a combinatorial point of view – less general, because within this theory every circuit has a finite intersection with every cocircuit. Within the present paper, we extend the theory of matroids with coefficients to more general classes of matroids, if the underlying fuzzy ring has certain properties to be specified.

Approximately counting bases of bicircular matroids

AbstractWe give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in 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.