Related papers: Multimatroids and rational curves with cyclic acti…
We define a moduli space of rational curves with finite-order automorphism and weighted orbits, and we prove that the combinatorics of its boundary strata are encoded by a particular polytopal complex that also captures the algebraic…
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…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
We define an intersection product of tropical cycles on matroid varieties (via cutting out the diagonal) and show that it is well-behaved. In particular, this enables us to intersect cycles on moduli spaces of tropical rational marked…
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…
We contribute to the foundations of tropical geometry with a view towards formulating tropical moduli problems, and with the moduli space of curves as our main example. We propose a moduli functor for the moduli space of curves and show…
We describe a framework to construct tropical moduli spaces of rational stable maps to a smooth tropical hypersurface or curve. These moduli spaces will be tropical cycles of the expected dimension, corresponding to virtual fundamental…
This article discusses a combinatorial extension of tropical intersection theory to spaces given by glueing quotients of partially open convex polyhedral cones by finitely many automorphisms. This extension is done in terms of linear…
Chow rings of toric varieties, which originate in intersection theory, feature a rich combinatorial structure of independent interest. We survey four different ways of computing in these rings, due to Billera, Brion, Fulton--Sturmfels, and…
Speyer recognized that matroids encode the same data as a special class of tropical linear spaces and Shaw interpreted tropically certain basic matroid constructions; additionally, Frenk developed the perspective of tropical linear spaces…
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…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the…
The combinatorial description via ribbon graphs of the moduli space of Riemann surfaces makes it possible to define combinatorial cycles in a natural way. Witten and Kontsevich first conjectured that these classes are polynomials in the…
The image of the complement of a hyperplane arrangement under a monomial map can be tropicalized combinatorially using matroid theory. We apply this to classical moduli spaces that are associated with complex reflection arrangements.…
This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than…
We determine the convergence regions of certain local integrals on the moduli spaces of curves in neighborhoods of fixed stable curves in terms of the combinatorics of the corresponding graphs.
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…