Related papers: The structure of claw-free binary matroids
A group, $\fl{H}$, of automorphisms of a totally disconnected locally compact group, $G$, is flat if there is a compact open $U\leq G$ such that the index $[\alpha(U):U\cap \alpha(U)]$ is mininimized for every $\alpha\in\fl{H}$. The…
We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure…
We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories…
A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
A complex hyperplane arrangement $\mathcal{A}$ is said to be decomposable if there are no elements in the degree 3 part of its holonomy Lie algebra besides those coming from the rank 2 flats. When this purely combinatorial condition is…
It is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this important theorem. We also described a discrete homotopy theorem…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
Given a family of graphs $\mathcal{H}$, a graph $G$ is $\mathcal{H}$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to any graph in $\mathcal{H}$. We present sufficient and necessary conditions for a graph…
In 2006 Bar{\'a}t and Thomassen conjectured that every planar $4$-edge-connected $4$-regular simple graph of size divisible by three admits a claw-decomposition. Later, Lai (2007) disproved this conjecture by a family of planar graphs with…
The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…
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.…
Let X be a smooth curve over a finite field of characteristic p, let E be a number field, and consider an E-compatible system of lisse sheaves on the curve X. For each place lambda of E not lying over p, the lambda-component of the system…
An affine oriented matroid is a combinatorial abstraction of an affine hyperplane arrangement. From it, Novik, Postnikov and Sturmfels constructed a squarefree monomial ideal in a polynomial ring, called an oriented matroid ideal, and got…
Dedekind stated and proved the well-known fact that a lattice is modular if and only if it does not contain a pentagon as a sublattice. In this paper we consider a similar result in the literature for the case of certain class of modular…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…
A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to: U2,5; U3,5; the Fano plane and its dual; the non-Fano and its dual; the single-element deletion of AG(2,3), its dual, and the…
In this paper we study a novel class of parabolic geometries which we call parabolic geometries of Monge type. These parabolic geometries are defined by special gradings of simple Lie algebras, namely, gradings with the property that their…
We show that the Whitney function of a q-matroid can be determined from the cloud and flock polynomials associated to the cyclic flats. These polynomials capture information about the corank (resp., nullity) of certain spaces whose cyclic…