Related papers: Polyhedral Homotopies in Cox Coordinates

We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…

In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, posets and polytopes. Our method relies on a simple and…

The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…

An action of a complex reductive group $\mathrm G$ on a smooth projective variety $X$ is regular when all regular unipotent elements in $\mathrm G$ act with finitely many fixed points. Then the complex $\mathrm G$-equivariant cohomology…

Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…

We study the local cohomology modules H^i_B(R) for a reduced monomial ideal B in a polynomial ring R=k[X_1,...,X_n]. We consider a grading on R which is coarser than the Z^n-grading such that each component of H^i_B(R) is finite dimensional…

The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…

Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…

We prove a conjecture of Bahri, Bendersky, Cohen and Gitler: if K is a shifted simplicial complex on n vertices, X_1,..., X_n are spaces and CX_i is the cone on X_i, then the polyhedral product determined by K and the pairs (CX_i,X_i) is…

In this paper, we propose a high-order extension of the multiscale method introduced by the authors in [SIAM J. Numer. Anal., 63(4) (2025), pp. 1617--1641] for heterogeneous Stokes problems, while also providing several other improvements,…

We prove that for every reductive algebraic group $H$ with centre of positive dimension and every integer $K$ there is a smooth and projective variety $X$ and an algebraic $H$-torsor $P \to X$ such that the classifying map $X \to \Bclass H$…

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

The optimal transport problem has many applications in machine learning, physics, biology, economics, etc. Although its goal is very clear and mathematically well-defined, finding its optimal solution can be challenging for large datasets…

The aim of this paper is to give the geometric realization of regular path complexes via (co)homology groups with coefficients in a ring $R$. Concretely, for each regular path complex $P$, we associate it with a singular $\Delta$-complex…

This paper provides an introduction to equivariant cohomology and homology using the approach of Goresky, Kottwitz, and MacPherson. When a group G acts suitably on a variety X, the equivariant cohomology of X can be computed using the…

Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…

Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial…

We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact…

We investigate the Cox ring of a normal complete variety X with algebraic torus action. Our first results relate the Cox ring of X to that of a maximal geometric quotient of X. As a consequence, we obtain a complete description of the Cox…