Related papers: Implementing real polyhedral homotopy
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
In biology, predicting RNA secondary structures plays a vital role in determining its physical and chemical properties. Although we have powerful energy models to predict them as well as parametric analysis to understand the models…
We characterise simply-connected biquotients which potentially admit metrics of holonomy G_2. We prove that there are at most three real homotopy types of rationally elliptic such manifolds---all of them being formal. In the course of this…
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
We study experimentally systems of orthogonal polynomials with respect to self-similar measures. When the support of the measure is a Cantor set, we observe some interesting properties of the polynomials, both on the Cantor set and in the…
A method to construct trihamiltonian extensions of a separable system is presented. The procedure is tested for systems, with a natural Hamiltonian, separable in classical sense in one of the four orthogonal separable coordinate systems of…
In this article, we describe a new algorithm for the expansion of hypergeometric functions about half-integer parameters. The implementation of this algorithm for certain classes of hypergeometric functions in the already existing…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
The polyhedral homotopy method of Huber and Sturmfels is a particularly efficient and robust numerical method for solving system of (Laurent) polynomial equations. A central component in an implementation of this method is an efficient and…
This paper presents two sufficient conditions to ensure a faithful evaluation of polynomial in IEEE-754 floating point arithmetic. Faithfulness means that the computed value is one of the two floating point neighbours of the exact result;…
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…
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…
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
Ehrhart theory measures a polytope P discretely by counting the lattice points inside its dilates P, 2P, 3P, .... We compute the Ehrhart quasipolynomials of the standard Coxeter permutahedra for the classical Coxeter groups, expressing them…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
In this paper, we introduce the notion of bi-homotopy between subsets of continuous functions. A map $\phi$ from $A$ to $B$ is called an $h$-map if, for each two homotopic maps $f, g\in A$, their image (i.e., $\phi(f), \phi(g)$) are…
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…