Related papers: On the effective Pourchet's Theorem
We describe a theoretical and effective algorithm which enables us to prove that rather general hypergeometric series and integrals can be decomposed as linear combinations of multiple zeta values, with rational coefficients.
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
We apply ideas related to the strength of polynomials to provide new cases of unirational hypersurfaces. It is famously known that hypersurfaces that are smooth in very high codimension are unirational, and a simple corollary then implies…
This expository paper is based on the author's series of lectures delivered at the January 1999 Mini-course in Number Theory, held at Sogang University (Seoul). The aim is to give an elementary and self-contained introduction to the theory…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
We prove a uniform effective density theorem as well as an effective counting result for a generic system comprising a polynomial with a mild homogeneous condition and several linear forms using Roger's second moment formula for the Siegel…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
We use a method, first developed for the Riemann zeta-function by Masser in ["Rational values of the Riemann zeta function", Journ. Num. Th. 131 (2011), 2037-2046], to prove a new zero estimate for polynomials in z and 1/Gamma(z). This…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…
Let I be an arbitrary ideal in C[[x,y]]. We use the Newton algorithm to compute by induction the motivic zeta function of the ideal, yielding only few poles, associated to the faces of the successive Newton polygons. We associate a minimal…
Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…
In 2022, Brugall{\'e} and Jaramillo-Puentes showed that the coefficients of small codegree of the tropical refined invariant are polynomial in the Newton polygon. This raised the question of the existence of universal polynomials giving…
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…