Related papers: Linear and Rational Factorization of Tropical Poly…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
We find a relation between mixed volumes of several polytopes and the convex hull of their union, deducing it from the following fact: the mixed volume of a collection of polytopes only depends on the product of their support functions…
We continue, in this second article, the study of the the algebraic tools which play a role in tropical algebra. We especially examine here the polynomial algebras over idempotent semi-fields. this work is motivated by the development of…
We introduce the notion of tropical defects, certificates that a system of polynomial equations is not a tropical basis, and provide two algorithms for finding them in affine spaces of complementary dimension to the zero set. We use these…
We present two effective tools for computing the positive tropicalization of algebraic varieties. First, we outline conditions under which the initial ideal can be used to compute the positive tropicalization, offering a real analogue to…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Tropical polyhedra seem to play a central role in static analysis of softwares. These tropical geometrical objects play also a central role in parity games especially mean payoff games and energy games. And determining if an initial state…
We study the tropicalization of intersections of plane curves, under the assumption that they have the same tropicalization. We show that the set of tropical divisors that arise in this manner is a pure dimensional balanced polyhedral…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
In this paper we study algorithmic aspects of tropical intersection theory. We analyse how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Tropical algebra is an emerging field with a number of applications in various areas of mathematics. In many of these applications appeal to tropical polynomials allows to study properties of mathematical objects such as algebraic varieties…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…