Related papers: Axioms for infinite matroids
We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…
In this paper we address two of the major foundational questions in the theory of matroids over rings. First, we provide a cryptomorphic axiomatisation, by introducing an analogue of the base polytope for matroids. Second, we describe a…
In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…
In an unpublished manuscript of 1992, Johan Karlander has given an axiomatization of affine oriented matroids. A closer examination of the text revealed an invalid construction and an incorrect argument in the proof of his main theorem.…
Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
We prove that an auxiliary two-point boundary value problem presented in V. L. Kharitonov, Lyapunov matrices for a class of time delay systems, Systems & Control Letters 55 (2006) 610-617 has linearly dependent boundary conditions, and…
We give a correspondence between simple matroids and a reconstruction of Alfred North Whitehead's theory of dimension, as developed in "On Mathematical Concepts of the Material World" (1906). In brief, if a geometrical system in the…
The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".
In this work we investigate the existence of solutions, their uniqueness and finally dependence on parameters for solutions of second order neutral nonlinear difference equations. The main tool which we apply is Darbo fixed point theorem.
Matroids are combinatorial abstractions of independence, a ubiquitous notion that pervades many branches of mathematics. June Huh and his collaborators recently made spectacular breakthroughs by developing a Hodge theory of matroids that…
We first establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. As applications, we exhibit several examples of additively idempotent semirings satisfying this condition, including a $4$-element…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
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…
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…
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 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…
We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…
For a transcendental entire function, a partial affirmative answer to Baker's question on the boundedness of its Fatou components is given. In addition, we have addressed Wang's question on Fej\'er gaps. Certain results about functions with…