Related papers: A module-theoretic approach to matroids
This is a survey paper on the connection of enriched category theory over a quantale and tropical mathematics. Quantales or complete idempotent semirings, as well as matrices with coefficients in them, are fundamental objects in both…
We show that the moduli spaces of irreducible labeled parametrized marked rational curves in toric varieties can be embedded into algebraic tori such that their tropicalizations are the analogous tropical moduli spaces. These embeddings are…
Given a homogeneous ideal $I$ in a polynomial ring over a field, one may record, for each degree $d$ and for each polynomial $f\in I_d$, the set of monomials in $f$ with nonzero coefficients. These data collectively form the tropicalization…
Modern categories of spectra such as that of Elmendorf et al equipped with strictly symmetric monoidal smash products allows the introduction of symmetric monoids providing a new way to study highly coherent commutative ring spectra. These…
We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
We study moduli spaces of rational weighted stable tropical curves, and their connections with the classical Hassett spaces. Given a vector w of weights, the moduli space of tropical w-stable curves can be given the structure of a balanced…
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
Tropical geometry is a relatively recent field in mathematics created as a simplified model for certain problems in algebraic geometry. We introduce the definition of abstract and planar tropical curves as well as their properties,…
We generalize the construction of a moduli space of semistable pairs parametrizing isomorphism classes of morphisms from a fixed coherent sheaf to any sheaf with fixed Hilbert polynomial under a notion of stability to the case of projective…
A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…