相关论文: Rank three matroids are Rayleigh
A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
The problem of finding the minimum rank of a matrix with a given zero-nonzero pattern has been generalized to a class of matroids associated to the pattern. The fundamental lower bound known as the triangle number still holds in this…
In 1981, Stanley applied the Aleksandrov-Fenchel inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with…
We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
Boundary measurement matrices associated to networks on a plane correspond to certain totally nonnegative Grassmannians as shown previously by A. Postnikov. In this paper, we look to generalize this result by categorizing the boundary…
Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is…
Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…
A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected…
We study a notion of cross ratios on metric graphs and electrical networks. We show that several known results immediately follow from the basic properties of cross ratios. We show that the projection matrices of Kirchhoff have nice (and…
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We prove a similar characterization for 3-connected matroids with modular 4-point lines. We show that such a matroid is either representable…
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.
We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…