Related papers: L-Infinity optimization in tropical geometry and p…
Let $w$ be an unbounded radial weight on the complex plane. We study the following approximation problem: find a proper holomorphic map $f: \mathbb{C}\to\mathbb{C}^n$ such that $|f|$ is equivalent to $w$. We give several characterizations…
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems. The first algorithm is based on a universal tangent direction, which has been recently proposed for…
We prove that the maximum independent set approximation problem with polylogarithmic approximation factor is P-SLOCAL-complete. Thus an efficient algorithm for the maximum independent set approximation in the LOCAL model implies efficient…
We prove that the number of tropical critical points of an affine matroid (M,e) is equal to the beta invariant of M. Motivated by the computation of maximum likelihood degrees, this number is defined to be the degree of the intersection of…
In this work, we study the dynamics of similarity classes of tetrahedra generated by the longest-edge bisection (LEB) algorithm. Building on the normalization strategy introduced by Perdomo and Plaza for triangles, we construct a canonical…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
Motivated by families of formal moduli problems, in this note we generalize the notion of L-infinity space by allowing sheaves of L-infinity algebras over any (reasonable) nilpotent dg manifold. We discuss various examples including those…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
We revisit the representation theory in type $A$used previously to establish that the dissimilarity vectors of phylogenetic trees are points on the tropical Grassmannian variety. We use a different version of this construction to show that…
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid,…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
Describing the combinatorial structure of the tropical complex $C$ of a tropical matroid polytope, we obtain a formula for the coarse types of the maximal cells of $C$. Due to the connection between tropical complexes and resolutions of…
The paper associates Lagrangian submanifolds in symplectic toric varieties to certain tropical curves inside the convex polyhedral domains of $\R^n$ that appear as the images of the moment map of the toric varieties. We pay a particular…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
Reciprocal best matches play an important role in numerous applications in computational biology, in particular as the basis of many widely used tools for orthology assessment. Nevertheless, very little is known about their mathematical…
Let $M$ be a closed complex submanifold in ${\mathbb C}^N$ with the complete K\"ahler metric induced by the Euclidean metric. Several finiteness theorems on the $L^p$ Bergman space of holomorphic sections of a given Hermitian line bundle…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…