Related papers: Beyond Polyhedral Homotopies
We prove two homotopy decomposition theorems for the loops on co-H-spaces, including a generalization of the Hilton-Milnor Theorem. These are applied to problems arising in algebra, representation theory, toric topology, and the study of…
We propose a generalization of tropical curves by dropping the rationality and integrality requirements while preserving the balancing condition. An interpretation of such curves as critical points of a certain quadratic functional allows…
Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average-case polynomial-time algorithms for computing approximate…
With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…
A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
In this paper we further develop the theory of geometric tropicalization due to Hacking, Keel and Tevelev and we describe tropical methods for implicitization of surfaces. More precisely, we enrich this theory with a combinatorial formula…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
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…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
We introduce a tropical geometric framework that allows us to define $\psi$ classes for moduli spaces of tropical curves of arbitrary genus. We prove correspondence theorems between algebraic and tropical $\psi$ classes for some…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
We apply tropical geometry to study matrix algebras over a field with valuation. Using the shapes of min-max convexity, known as polytropes, we revisit the graduated orders introduced by Plesken and Zassenhaus. These are classified by the…
Starting from the Rodrigues representation of polynomial solutions of the general hypergeometric-type differential equation complementary polynomials are constructed using a natural method. Among the key results is a generating function in…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
The homotopy continuation method has been widely used in solving parametric systems of nonlinear equations. But it can be very expensive and inefficient due to singularities during the tracking even though both start and end points are…
We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities). The heart of the tropical algorithm is…
This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…
Numerical nonlinear algebra is a computational paradigm that uses numerical analysis to study polynomial equations. Its origins were methods to solve systems of polynomial equations based on the classical theorem of B\'ezout. This was…