Related papers: Rigid Matroid Categories
In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…
We define a matroid invariant called the three-cosystole that is related to higher notions of cogirth for weighted matroids, and we prove an optimal upper bound for it in the class of regular matroids of rank at most six. To accomplish…
Revisiting canonical integration of the classical solid near a uniform rotation, canonical action angle coordinates, hyperbolic and elliptic, are constructed in terms of various power series with coefficients which are polynomials in a…
This note contains some results related to the definitions of toroidal embeddings and toroidal morphisms over non-closed fields of characteristic zero.
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…
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…
We provide conditions on a monoidal model category $\mathcal{M}$ so that the category of commutative monoids in $\mathcal{M}$ inherits a model structure from $\mathcal{M}$ in which a map is a weak equivalence or fibration if and only if it…
Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…
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…
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…
Given a domain of characteristic zero $R$, we functorially construct a rigid symmetric monoidal stable $\infty$-category whose $K_0$ is $R$, solving a problem of Khovanov. We also functorially construct for any reduced commutative ring $R$…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…
Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids (which is not possible for…
We consider sets with infinite addition, called $\Sigma$-monoids, and contribute to their literature in three ways. First, our definition subsumes those from previous works and allows us to relate them in terms of adjuctions between their…