Related papers: Polyhedral Homotopies in Cox Coordinates
Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both approaches have…
Discrete optimization is a central problem in mathematical optimization with a broad range of applications, among which binary optimization and sparse optimization are two common ones. However, these problems are NP-hard and thus difficult…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…
We show that the multi-boson KP hierarchies possess a class of discrete symmetries linking them to the discrete Toda systems. These discrete symmetries are generated by the similarity transformation of the corresponding Lax operator. This…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
In this work we provide an explicit cdga that controls the rational homotopy type of the complement $X-\cup_i Z_i$, where $X$ is a smooth compact algebraic variety and $\{Z_i\}$ is a collection of subvarieties such that all set-theoretical…
We develop a certified numerical algorithm for computing Galois/monodromy groups of parametrized polynomial systems. Our approach employs certified homotopy path tracking to guarantee the correctness of the monodromy action produced by the…
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…
In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different…
Let X be a smooth toric variety. David Cox introduced the homogeneous coordinate ring S of X and its irrelevant ideal B. Extending well-known results on projective space, Cox established the following: (1) the category of quasi-coherent…
The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…
Tethered robots play a pivotal role in specialized environments such as disaster response and underground exploration, where their stable power supply and reliable communication offer unparalleled advantages. However, their motion planning…
We study classes of Dynamic Programming (DP) algorithms which, due to their algebraic definitions, are closely related to coefficient extraction methods. DP algorithms can easily be modified to exploit sparseness in the DP table through…
High dimensional sparse learning has imposed a great computational challenge to large scale data analysis. In this paper, we are interested in a broad class of sparse learning approaches formulated as linear programs parametrized by a {\em…
We present a simple method to calculate the Stokes matrix for the quantum cohomology of the projective spaces ${CP}^{k-1}$ in terms of certain hypergeometric group. We present also an algebraic variety whose fibre integrals are solutions to…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanit\`a. As a consequence, finding a shortest sequence of…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
We associate to every divisorial (e.g. smooth) variety $X$ with only constant invertible global functions and finitely generated Picard group a $Pic(X)$-graded homogeneous coordinate ring. This generalizes the usual homogeneous coordinate…
We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…