Related papers: Axioms for infinite matroids
We consider a class of nonlinear ordinary differential equations of the second order with parameters. We establish conditions for perturbations of the coefficients of the equation under which the zero solution is asymptotically stable.…
We prove that, if $B_1, \dots, B_n$ are disjoint bases of a rank-$n$ matroid, then there are at least $\lfloor{\frac{n}{6 \lceil{\log n}\rceil}}\rfloor$ disjoint transversals of $(B_1, \dots, B_n)$ that are also bases.
A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…
We propose a framework for a new type of finite field theories based on a hidden duality between an ultra-violet and an infra-red region. Physical quantities do not receive radiative corrections at a fundamental scale or the fixed point of…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…
In this paper, we construct indecomposable integrally closed modules of arbitrary rank over a two-dimensional regular local ring. The modules are quite explicitly constructed from a given complete monomial ideal. We also give structural and…
The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
A fundamental question in parallel computation, posed by Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988), asks: \emph{given only independence-oracle access to a matroid on $n$ elements, how many rounds are required to find a basis using…
In this paper we prove that the Carath\'eodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of the ground set.
We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…
Using the theory of fixed point index, we establish new results for the existence of nonzero solutions of Hammerstein integral equations with reflections. We apply our results to a first order periodic boundary value problem with…
It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…
We show that the class of Metropolis-Rota implication algebras can be given a universal axiomatization using an operation closely related to composition in oriented matroids. Lastly we describe the role of our new operation in the collapse…
In this paper, we prove a finite basis theorem for radical well-mixed difference ideals generated by binomials. As a consequence, every strictly ascending chain of radical well-mixed difference ideals generated by binomials in a difference…
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
Can the real line with removed zero be covered by countably many linearly (algebraically) independent subsets over the field of rationals? We use a matroid approach to show that an answer is "Yes" under the Continuum Hypothesis, and "No"…
The main result is Theorem MAT 11 which states that every finite closure operator is the ground set of a matroid. Its base sets consist of nonredundant covers of of the closure. These are minimal subsets that determine the closure operator…