Related papers: Limit linear series: combinatorial theory

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…

We investigate the smoothing problem of limit linear series of rank one on an enrichment of the notions of nodal curves and metrized complexes called saturated metrized complexes. We give a finitely verifiable full criterion for…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

We propose to study the tropical geometry specifically arising from convergent Hahn series in multiple indeterminates. One application is a new view on stable intersections of tropical hypersurfaces. Another one is perturbations of rank one…

Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…

We investigate different notions of linear independence and of matrix rank that are relevant for max-plus or tropical semirings. The factor rank and tropical rank have already received attention, we compare them with the ranks defined in…

Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Building on the limit theory for set functions, we prove that the limit of convergent sequence of bounded-degree graphs' cycle matroids can be represented as the cycle matroid of a graphing, analogous to the completeness result for…

A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…

A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…

We enumerate rational curves in toric surfaces passing through points and satisfying cross-ratio constraints using tropical and combinatorial methods. Our starting point is arXiv:1509.07453, where a tropical-algebraic correspondence theorem…