Related papers: Long and winding central paths
Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…
We propose a definition of tropical linear series that isolates some of the essential combinatorial properties of tropicalizations of not-necessarily-complete linear series on algebraic curves. The definition combines the Baker-Norine…
It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…
The goal of this paper is to relax convexity assumption on some classical results in mean curvature flow. In the first half of the paper, we prove a generalized version of Hamilton's differential Harnack inequality which holds for mean…
Tropical Differential Algebraic Geometry considers difficult or even intractable problems in Differential Equations and tries to extract information on their solutions from a restricted structure of the input. The Fundamental Theorem of…
In this article, we present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of finite symmetries. We compute the tropical Grassmannian TGr$_0(3,8)$, and show that it refines the…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
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 prove a polynomial bound in the "true complexity" problem of Gowers and Wolf. The proof uses only repeated applications of the Cauchy--Schwarz inequality, answering negatively a question posed by Gowers and Wolf. To choose and reason…
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes,…
We develop a complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor. By deriving expressions for the associated generating functions, we also…
Let X be a plane in a torus over an algebraically closed field K, with tropicalization the matroidal fan Sigma. In this paper we present an algorithm which completely solves the question whether a given one-dimensional balanced polyhedral…
Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatorial diameters. The main open problem in this area is the…
In this survey, we discuss linear series on tropical curves and their relation to classical algebraic geometry, describe the main techniques of the subject, and survey some of the recent major developments in the field, with an emphasis on…
The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the…
We produce new combinatorial methods for approaching the tropical maximal rank conjecture, including inductive procedures for deducing new cases of the conjecture on graphs of increasing genus from any given case. Using explicit…
Tropical geometry yields good lower bounds, in terms of certain combinatorial-polyhedral optimisation problems, on the dimensions of secant varieties. In particular, it gives an attractive pictorial proof of the theorem of Hirschowitz that…
We show how to equip the cone complexes of toroidal embeddings with additional structure that allows to define a balancing condition for weighted subcomplexes. We then proceed to develop the foundations of an intersection theory on cone…
Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…
The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…