Related papers: Long and winding central paths
We give several characterizations of stable intersections of tropical cycles and establish their fundamental properties. We prove that the stable intersection of two tropical varieties is the tropicalization of the intersection of the…
We relate a coherent sheaf supported on a holomorphic curve with its mirror Langrangian submanifold in local mirror symmetry through a tropical curve by interpreting their central charges using the combinatorial information of the tropical…
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…
In contrast to the situation in classical linear algebra, not every tropically non-singular matrix can be factored into a product of tropical elementary matrices. We do prove the factorizability of any tropically non-singular 2x2 matrix…
We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We provide an account for the existence and uniqueness of solutions to rough differential equations under the framework of controlled rough paths. The case when the driving path is $\beta$-H\"older continuous, for $\beta>1/3$, is widely…
An algorithm to give an explicit description of all the solutions to any tropical linear system $A\odot x=B\odot x$ is presented. The given system is converted into a finite (rather small) number $p$ of pairs $(S,T)$ of classical linear…
The central levels problem asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s, i.e., the vertices in the middle $2\ell$ levels, has a…
We construct motivic invariants of a subvariety of an algebraic torus from its tropicalization and initial degenerations. More specifically, we introduce an invariant of a compactification of such a variety called the "tropical motivic…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…
We develop a version of Mikhalkin's lattice path algorithm for projective hypersurfaces of arbitrary degree and dimension, which enumerates singular tropical hypersurfaces passing through appropriate configuration of points. By proving a…
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimization. Despite the consistent efforts on this problem, all…
A tropical complete intersection curve C in R^(n+1) is a transversal intersection of n smooth tropical hypersurfaces. We give a formula for the number of vertices of C given by the degrees of the tropical hypersurfaces. We also compute the…
This paper establishes the existence and uniqueness of solutions for rough differential equations driven by reduced rough paths with low regularity, specifically in the roughness regime $\frac{1}{3} < \alpha \leq \frac{1}{2}$. While the…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees.…