Related papers: Polyhedral Homotopies in Cox Coordinates

In 1998, Goresky, Kottwitz, and MacPherson showed that for certain projective varieties X equipped with an algebraic action of a complex torus T, the equivariant cohomology ring H_T(X) can be described by combinatorial data obtained from…

Homotopy perturbation method is used for solving the multi-point boundary value problems. The approximate solution is found in the form of a rapidly convergent series. Several numerical examples have been considered to illustrate the…

In our previous work, a unified description as polynomial Hamiltonian systems was established for a broad class of the Schlesinger systems including the sixth Painleve equation and Garnier systems. The main purpose of this paper is to…

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

Let X be a complete toric variety with homogeneous coordinate ring S. In this article, we compute upper and lower bounds for the codimension in the critical degree of ideals of S generated by dim(X)+1 homogeneous polynomials that don't…

There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…

We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…

Let $G$ and $H$ be locally compact groups with fixed two-side-invariant Haar measures. A polyhomomorphism $G\to H$ is a closed subgroup $R\subset G\times H$ with a fixed Haar measure, whose marginals on $G$ and $H$ are dominated by the Haar…

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

Given an affine toric variety $X$ embedded in a smooth variety, we prove a general result about the mixed Hodge module structure on the local cohomology sheaves of $X$. As a consequence, we prove that the singular cohomology of a proper…

Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this…

We study the projective geometry of homogeneous varieties $X= G/P\subset P(V)$, where $G$ is a complex simple Lie group, $P$ is a maximal parabolic subgroup and $V$ is the minimal $G$-module associated to $P$. Our study began with the…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

This chapter investigates how symmetries can be used to reduce the computational complexity in polynomial optimization problems. A focus will be specifically given on the Moment-SOS hierarchy in polynomial optimization, where results from…

We give a short new computation of the quantum cohomology of an arbitrary smooth toric variety $X$, by showing directly that the Kodaira-Spencer map of Fukaya-Oh-Ohta-Ono defines an isomorphism onto a suitable Jacobian ring. The proof is…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

In the PATH COVER problem, one asks to cover the vertices of a graph using the smallest possible number of (not necessarily disjoint) paths. While the variant where the paths need to be pairwise vertex-disjoint, which we call PATH…

The main theorem of this paper classifies the quasi-geodesics in a Coxeter group that are tracked by geodesics. As corollaries, we show that if a Coxeter group acts geometrically on a CAT(0) space X then CAT(0) rays (and lines) are tracked…

Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…