Related papers: L-Infinity optimization in tropical geometry and p…
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstruction are each determined by a polyhedral subdivision of…
The space T_{d,n} of n tropically collinear points in a fixed tropical projective space TP^{d-1} is equivalent to the tropicalization of the determinantal variety of matrices of rank at most 2, which consists of real d x n matrices of…
This paper focuses on representing the $L^{\infty}$-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to…
Using tropical geometry we propose a mirror construction for monomial degenerations of Calabi-Yau varieties in toric Fano varieties. The construction reproduces the mirror constructions by Batyrev for Calabi-Yau hypersurfaces and by Batyrev…
This thesis presents new applications of Gale duality to the study of polytopes, point configurations and oriented matroids with extremal combinatorial properties. The first part of the thesis explores construction techniques for neighborly…
We study flexible polyhedral nets in isotropic geometry. This geometry has a degenerate metric, but there is a natural notion of flexibility. We study infinitesimal and finite flexibility, and classify all finitely flexible polyhedral nets…
This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
By the Riemann-mapping theorem, one can bijectively map the interior of an $n$-gon $P$ to that of another $n$-gon $Q$ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of $P$ to those $Q$.…
We revisit the Universal Approximation Theorem(UAT) through the lens of the tropical geometry of neural networks and introduce a constructive, geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs). Tropical geometry…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
It is well known among phylogeneticists that adding an extra taxon (e.g. species) to a data set can alter the structure of the optimal phylogenetic tree in surprising ways. However, little is known about this "rogue taxon" effect. In this…
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise…
The contributions of the paper span theoretical and implementational results. First, we prove that Kd-trees can be extended to spaces in which the distance is measured with an arbitrary Bregman divergence. Perhaps surprisingly, this shows…
Phylogenetic models have polynomial parametrization maps. For symmetric group-based models, Matsen studied the polynomial inequalities that characterize the joint probabilities in the image of these parametrizations. We employ this…
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to…