Related papers: Beyond Polyhedral Homotopies
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
In this paper, we introduce and analyze a normalization method for solving a system of linear equations over tropical semirings. We use a normalization method to construct an associated normalized matrix, which gives a technique for solving…
A geometric approach to the stable homotopy groups of spheres is developed in this paper, based on the Pontryagin-Thom construction. The task of this approach is to obtain an alternative proof of the Hill-Hopkins-Ravenel theorem [H-H-R] on…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
The aim of this article is to explain a philosophy for applying higher dimensional Seifert-van Kampen Theorems, and how the use of groupoids and strict higher groupoids resolves some foundational anomalies in algebraic topology at the…
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).
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
We present a new numerical homotopy continuation algorithm for finding all solutions to Schubert problems on Grassmannians. This Littlewood-Richardson homotopy is based on Vakil's geometric proof of the Littlewood-Richardson rule. Its start…
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…
We introduce a novel intrinsic volume concept in tropical geometry. This is achieved by developing the foundations of a tropical analog of lattice point counting in polytopes. We exhibit the basic properties and compare it to existing…
An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…
We study the combinatorial properties of 2-dimensional tropical complexes. In particular, we prove tropical analogues of the Hodge index theorem and Noether's formula. In addition, we introduce algebraic equivalence for divisors on tropical…
In a previous article, we proved tight lower bounds for the coefficients of the generalized $h$-vector of a centrally symmetric rational polytope using intersection cohomology of the associated projective toric variety. Here we present a…
We study the behavior of phylogenetic tree shapes in the tropical geometric interpretation of tree space. Tree shapes are formally referred to as tree topologies; a tree topology can also be thought of as a tree combinatorial type, which is…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…
The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…