Related papers: Matroid Theory and Hrushovski's Predimension Const…
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.
Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…
We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…
This paper concerns the study of Bi-colored expansions of geometric theories in the light of the Fra\"{i}ss\'{e}-Hrushovski construction method. Substructures of models of a geometric theory $T$ are expanded by a color predicate $p$, and…
We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…
Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…
Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…
We consider generalized metric spaces taking distances in an arbitrary ordered commutative monoid, and investigate when a class $\mathcal{K}$ of finite generalized metric spaces satisfies the Hrushovski extension property: for any…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…
Kinser developed a hierarchy of inequalities dealing with the dimensions of certain spaces constructed from a given quantity of subspaces. These inequalities can be applied to the rank function of a matroid, a geometric object concerned…
We develop a theory of principal determinants and hypergeometric systems for realizable matroids. Our framework parallels the toric theory of Gel'fand, Kapranov, and Zelevinsky (GKZ), but with the combinatorics of matroids and their flats…
A Structure Theorem for Protori is derived for the category of finite-dimensional protori(compact connected abelian groups), which details the interplay between the properties of density, discreteness, torsion, and divisibility within a…
We introduce a construction of oriented matroids from a triangulation of a product of two simplices. For this, we use the structure of such a triangulation in terms of polyhedral matching fields. The oriented matroid is composed of…
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…
We develop the theory of matroids over one-dimensional algebraic groups, with special emphasis on positive characteristic. In particular, we compute the Lindstr\"om valuations and Frobenius flocks of such matroids. Building on work by Evans…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't. In general these varieties are very ill-behaved, but in many cases one can estimate their…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
We give a characterization of a matroid to be paving, through its set of hyperplanes and give an algorithm to construct all of them.
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…