相关论文: On a generalisation of spikes

If $C_1$ and $C_2$ are circuits in a matroid $M$ with $e_1$ in $C_1-C_2$ and $e$ in $C_1\cap C_2$, then $M$ has a circuit $C_3$ such that $e\in C_3\subseteq (C_1\cup C_2)-e$. This strong circuit elimination axiom is inherently asymmetric. A…

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

We say that a family of $k$-subsets of an $n$-element set is intersecting, if any two of its sets intersect. In this paper we study different extremal properties of intersecting families, as well as the structure of large intersecting…

A simple binary matroid, viewed as a restriction of a finite binary projective geometry $PG(n-1,2)$, is $I_{1,t}$-free if for any rank-$t$ flat of $PG(n-1,2)$, its intersection with the matroid is not a one-element set. In this paper, we…

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

Let b(M) denote the maximal number of disjoint bases in a matroid M. It is shown that if M is a matroid of rank d+1, then for any continuous map f from the matroidal complex M into the d-dimensional Euclidean space there exist t \geq…

We consider two types of matroids defined on the edge set of a graph $G$: count matroids ${\cal M}_{k,\ell}(G)$, in which independence is defined by a sparsity count involving the parameters $k$ and $\ell$, and the (three-dimensional…

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field $GF(q)$ and any integer $t$, every cosimple $GF(q)$-representable matroid with sufficiently large girth contains either $M(K_t)$ or $M(K_t)^*$ as a minor.

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

We prove that the set of all paths of a fixed length in a complete multipartite graph is the bases of a matroid. Moreover, we discuss the Cohen-Macaulayness and depth of powers of $t$-path ideals of a complete multipartite graph.

A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of…

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…