Related papers: Detecting integral polyhedral functions
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…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
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 method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
This paper studies the following question: given a piecewise-linear function, find its minimal algebraic representation as a tropical rational signomial. We put forward two different notions of minimality, one based on monomial length, the…
We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding infinitesimal perturbations). We develop a tropical…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…
Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…
We define tropical rational function semifields $\overline{\boldsymbol{T}(X_1, \ldots, X_n)}$ and prove that a tropical curve $\varGamma$ is realized (except for points at infinity) as the congruence variety $V \subset \boldsymbol{R}^n$…
In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
Research on refinable functions in wavelet theory is mostly focused to localized functions. However it is known, that polynomial functions are refinable, too. In our paper we investigate on conversions between refinement masks and…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
Discrete Fenchel duality is one of the central issues in discrete convex analysis. The Fenchel-type min-max theorem for a pair of integer-valued M-natural-convex functions generalizes the min-max formulas for polymatroid intersection and…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…