Related papers: On the effective Pourchet's Theorem
Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…
We present a new group-theoretical technique to calculate weak field expansions for some Feynman diagrams using invariant polynomials of the dihedral group. In particular we show results obtained for the first coefficients of the three loop…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
We propose a computation of real motivic zeta functions for real polynomial functions, using Newton polyhedron. As a consequence we show that the weights are blow-Nash invariants of convenient weighted homogeneous polynomials in three…
The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…
We prove a conjecture of Kontsevich, which asserts that the iterations of the noncommutative rational map $F_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1})$ are given by noncommutative Laurent polynomials with nonnegative integer coefficients.
We develop a generalized Newton scheme IHNC for the construction of effective pair potentials for systems of interacting point-like particles.The construction is made in such a way that the distribution of the particles matches a given…
For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
We establish effective versions of Oppenheim's conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed shift vectors and generic quadratic forms. When the shift is rational we prove a counting result which…
Recently, Peter Doyle and Curt McMullen devised an iterative solution to the fifth degree polynomial. At the method's core is a rational mapping of the Riemann sphere with the icosahedral symmetry of a general quintic. Moreover, this map…
An algebraic soliton of the massive Thirring model (MTM) is expressed by the simplest rational solution of the MTM with the spatial decay of $\mathcal{O}(x^{-1})$. The corresponding potential is related to a simple embedded eigenvalue in…
The purpose of this manuscript is to derive two distinct integral representations of the generalized polylogarithm using two different techniques. The first approach involves the Dirichlet series and its Laplace representation, which leads…
We present a new numerical method for the isometric embedding of 2-geometries specified by their 2-metrics in three dimensional Euclidean space. Our approach is to directly solve the fundamental embedding equation supplemented by six…
In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…
If there is one polygon inscribed into some smooth conic and circumscribed about another one, then there are infinitely many such polygons. This is Poncelet's theorem. The aim of this note is to collect some (mostly classical) versions of…
Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…
We provide a representation in terms of certain canonical functions for a sequence of polynomials orthogonal with respect to a weight that is strictly positive and analytic on the unit circle. These formulas yield a complete asymptotic…
Nonconvex optimization is central to modern machine learning, but the general framework of nonconvex optimization yields weak convergence guarantees that are too pessimistic compared to practice. On the other hand, while convexity enables…
The classical version of P\'olya's theorem provides a simple method for certifying that a homogeneous polynomial of degree d is strictly copositive, that is, it takes only positive values on the nonnegative real orthant. However, this…