Related papers: L-Infinity optimization in tropical geometry and p…
We consider a binary classifier defined as the sign of a tropical rational function, that is, as the difference of two convex piecewise linear functions. The parameter space of ReLU neural networks is contained as a semialgebraic set inside…
In this paper we use the superpotential for the flag variety $GL_n/B$ and particular coordinate systems that we call ideal coordinates for $\mathbf{i}$, to construct polytopes $\mathcal{P}^{\mathbf{i}}_\lambda$ inside $\mathbb{R}^{R_+}$,…
We generalise the notion of Gr\"obner fan to ideals in R[[t]][x_1,...,x_n] for certain classes of coefficient rings R and give a constructive proof that the Gr\"obner fan is a rational polyhedral fan. For this we introduce the notion of…
We give a construction of an L-infinity map from any L-infinity algebra into its truncated Chevalley-Eilenberg complex as well as its cyclic and A-infinity analogues. This map fits with the inclusion into the full Chevalley-Eilenberg…
In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for…
We investigate location problems whose optimum lies in the tropical convex hull of the input points. Firstly, we study geodesically star-convex sets under the asymmetric tropical distance and introduce the class of tropically quasiconvex…
The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this…
The neighbor-joining algorithm is a popular phylogenetics method for constructing trees from dissimilarity maps. The neighbor-net algorithm is an extension of the neighbor-joining algorithm and is used for constructing split networks. We…
Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this area is that bipartite maximum matching…
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 extend the Abreu-Guillemin theory of invariant K\"ahler metrics from toric symplectic manifolds to any symplectic manifold admitting a toric action of a symplectic torus bundle. We show that these are precisely the symplectic manifolds…
We propose a novel method for the inference of phylogenetic trees that utilises point configurations on hyperbolic space as its optimisation landscape. Each taxon corresponds to a point of the point configuration, while the evolutionary…
We give a rigorous definition of tropical fans (the "local building blocks for tropical varieties") and their morphisms. For such a morphism of tropical fans of the same dimension we show that the number of inverse images (counted with…
The kinematic/robotic community is not only interested in measuring the closeness of a given robot configuration to its next singular one but also in a geometric meaningful index evaluating how far the robot design is away from being…
The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept…
Boob et al. [1] described an iterative peeling algorithm called Greedy++ for the Densest Subgraph Problem (DSG) and conjectured that it converges to an optimum solution. Chekuri, Quanrud, and Torres [2] extended the algorithm to general…
For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…
We develop a unified spectral framework for finite ultrametric phylogenetic trees, grounding the analysis of phylogenetic structure in operator theory and stochastic dynamics in the finite setting. For a given finite ultrametric measure…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…
The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…