Related papers: An excluded minors method for infinite matroids

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…

We describe an implementation of a computer search for the "small" excluded minors for a class of matroids representable over a partial field. Using these techniques, we enumerate the excluded minors on at most 15 elements for both the…

A self-contained introduction to infinite dimensional representations over a tame hereditary algebra is provided, assuming a basic knowledge of the category of finite dimensional representations. This includes a complete description of all…

A closed discrete subset $A\subset \mathbb{C}$ is called tame if $\mathbb{C}\setminus A$ is quasiconformally equivalent to $\mathbb{C}\setminus \mathbb{Z}$. By giving several criteria for $A$ to be tame, we shall show that…

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which…

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

We introduce and study tame homeomorphisms of surfaces of infinite type. These are maps for which curves under iterations do not accumulate onto geodesic laminations with non-proper leaves, but rather just a union of possibly intersecting…

We show that, also within the class of representation-tame finite dimensional algebras $\Lambda$, the big left finitistic dimension of $\Lambda$ may be strictly larger than the little. In fact, the discrepancies $Findim \Lambda - findim…

Let $p$ be a prime number, and let $k$ be an algebraically closed field of characteristic $p$. We show that the tame fundamental group of a smooth affine curve over $k$ is a projective profinite group. We prove that the fundamental group of…

We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third…

One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give…

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…

A matroid is uniform if and only if it has no minor isomorphic to $U_{1,1}\oplus U_{0,1}$ and is paving if and only if it has no minor isomorphic to $U_{2,2}\oplus U_{0,1}$. This paper considers, more generally, when a matroid $M$ has no…