Related papers: Matroids arisen from seeds
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
This note contains additions to the paper 'Clustered cell decomposition in P-minimal structures' (arXiv:1612.02683). We discuss a question which was raised in that paper, on the order of clustered cells. We also consider a notion of cells…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety, and show that valuative, homological, and numerical equivalence…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
Cluster type varieties are compactifications of algebraic tori on which the volume form has no zeros. These form a natural class of varieties that generalizes both toric varieties and cluster varieties. The aim of this article is to…
Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…
We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…
Recently, M.~Baker and N.~Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generalize the notion of minors and direct sums from ordinary matroids to…
In this article, we introduce the notion of cluster automorphism of a given cluster algebra as a $\ZZ$-automorphism of the cluster algebra that sends a cluster to another and commutes with mutations. We study the group of cluster…
We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…
In [LP] we introduced Laurent phenomenon algebras, a generalization of cluster algebras. Here we give an explicit description of Laurent phenomenon algebras with a linear initial seed arising from a graph. In particular, any graph…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…
Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…
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…