English
Related papers

Related papers: Polyhedral Homotopies in Cox Coordinates

200 papers

This paper presents a systematic approach for computing local solutions to motion planning problems in non-convex environments using numerical optimal control techniques. It extends the range of use of state-of-the-art numerical optimal…

Optimization and Control · Mathematics 2017-10-03 Kristoffer Bergman , Daniel Axehill

Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…

Algebraic Geometry · Mathematics 2015-06-11 Kiumars Kaveh , A. G. Khovanskii

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

The paper presents a proof of the Hodge Riemann relations for the combinatorial intersection cohomology of a polytope, as fist given by K.Karu, in terms of geometric operations on polytopes.

Algebraic Geometry · Mathematics 2007-05-23 G. Barthel , J. -P-Brasselet , K. -H. Fieseler , L. Kaup

We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…

Algebraic Geometry · Mathematics 2020-09-01 Michael Burr , Frank Sottile , Elise Walker

Given a graph $G$, and terminal vertices $s$ and $t$, the TRACKING PATHS problem asks to compute a minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each s-t path is unique. TRACKING…

Data Structures and Algorithms · Computer Science 2020-02-19 Pratibha Choudhary

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…

Computational Complexity · Computer Science 2024-12-24 Jin-Yi Cai , Ashwin Maran

We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…

Numerical Analysis · Mathematics 2016-11-01 Daniel Elfverson , Mats G. Larson , Axel Målqvist

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

Number Theory · Mathematics 2021-06-08 J. Maurice Rojas , Yuyu Zhu

Steenrod homotopy theory is a framework for doing algebraic topology on general spaces in terms of algebraic topology of polyhedra; from another viewpoint, it studies the topology of the lim^1 functor (for inverse sequences of groups). This…

Algebraic Topology · Mathematics 2009-10-15 Sergey A. Melikhov

Multilinear systems of equations arise in various applications, such as numerical partial differential equations, data mining, and tensor complementarity problems. In this paper, we propose a homotopy method for finding the unique positive…

Numerical Analysis · Mathematics 2017-01-27 Lixing Han

Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…

Symbolic Computation · Computer Science 2013-05-07 Jean-Charles Faugère , Mohab Safey El Din , Thibaut Verron

We give a framework for constructing generically optimal homotopies for parametrized polynomial systems from tropical data. Here, generically optimal means that the number of paths tracked is equal to the generic number of solutions. We…

Algebraic Geometry · Mathematics 2024-12-31 Paul Alexander Helminck , Oskar Henriksson , Yue Ren

The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…

Optimization and Control · Mathematics 2020-04-09 Alberto Del Pia , Carla Michini

In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…

Numerical Analysis · Mathematics 2019-02-20 Patrick Henning , Axel Malqvist , Daniel Peterseim

The Chow quotient of a projective variety by the action of a complex torus is known to have a very complicated geometry, even in the case of simple varieties, such as rational homogeneous varieties. In this paper we propose an approach in…

Algebraic Geometry · Mathematics 2026-05-08 Luis E. Solá Conde , Gianluca Occhetta

It is a survey of the results on the classification of stable homotopy types of polyhedra of small dimensions, mainly obtained by H.-J. Baues and the author. The proofs are based on the technique of matrix problems (bimodule categories).

Algebraic Topology · Mathematics 2012-01-24 Yuriy A. Drozd

In the present paper we provide a general algorithm to compute multiplicative cohomological operations on algebraic oriented cohomology of projective homogeneous G-varieties, where G is a split reductive algebraic group over a field of…

Algebraic Geometry · Mathematics 2020-01-03 Kirill Zainoulline

The homotopy analysis method known from its successful applications to obtain quasi-analytical approximations of solutions of ordinary and partial differential equations is applied to stochastic differential equations with Gaussian…

Statistical Mechanics · Physics 2014-10-08 Maciej Janowicz , Filip Krzyżewski , Joanna Kaleta , Marian Rusek , Arkadiusz Orłowski

For each positive integer Q there exists a path connected metric compactum X such that the Qth-homotopy group of X is compactly generated but not a topological group (with the quotient topology).

Algebraic Topology · Mathematics 2011-06-01 Paul Fabel