English
Related papers

Related papers: Truncated Plethystic Exponentials Preserve Power S…

200 papers

Littlewood polynomials are polynomials with each of their coefficients in $\{-1,1\}$. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Classical Analysis and ODEs · Mathematics 2023-11-09 Tamás Erdélyi

We consider the effective resummation of a Borel sum by its associated factorial series expansion. Our approach provides concrete estimates for the remainder term when truncating this factorial series. We then generalize a theorem of…

Complex Variables · Mathematics 2007-05-23 Eric Delabaere , Jean-Marc Rasoamanana

The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…

Computational Complexity · Computer Science 2022-11-30 Tatiana Belova , Alexander Golovnev , Alexander S. Kulikov , Ivan Mihajlin , Denil Sharipov

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

Rings and Algebras · Mathematics 2025-07-09 Peter Danchev , Esther García , Miguel Gómez Lozano

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Classical Analysis and ODEs · Mathematics 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

Complex Variables · Mathematics 2010-09-23 Dan Coman , Evgeny A. Poletsky

Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…

Computational Complexity · Computer Science 2026-01-22 Somnath Bhattacharjee , Markus Bläser , Pranjal Dutta , Saswata Mukherjee

Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…

Combinatorics · Mathematics 2026-03-25 Jean-Christophe Pain

We consider arbitrary algebraic families of lower order deformations of nondegenerate toric exponential sums over a finite field. We construct a relative polytope with the aid of which we define a ring of coefficients consisting of p-adic…

Number Theory · Mathematics 2013-07-02 C. Douglas Haessig , Steven Sperber

For the Dirichlet integral fractional Laplacian, we prove root exponential convergence of tensor-product $hp$-finite element approximations on $(0,1)^3$, for forcing $f$ that is analytic in $[0,1]^3$. Exploiting analytic regularity…

Numerical Analysis · Mathematics 2026-03-16 Björn Bahr , Markus Faustmann , Carlo Marcati , Jens Markus Melenk , Christoph Schwab

Let $f$ be a polynomial of degree $d>1$ in $n$ variables over $\mathbb{Z}$. Let $f_d$ be the homogeneous part of degree $d$ of $f$ and $s$ be the dimension of the critical locus of $f_d$. In this paper, we prove Igusa's conjecture for…

Number Theory · Mathematics 2021-11-24 Kien Huu Nguyen

We shall introduce and study certain truncated sums of Hecke eigenvalues of $GL_2$-automorphic forms along quadratic polynomials. A power saving estimate is established and new applications to moments of critical $L$-values associated to…

Number Theory · Mathematics 2019-12-19 Nicolas Templier

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

Algebraic Geometry · Mathematics 2022-05-04 Arthur Bik , Alessandro Oneto

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

Algebraic Geometry · Mathematics 2023-03-09 Cordian Riener , Robin Schabert

We introduce a new method to approximate Euclidean correlation functions by exponential sums. The Truncated Hankel Correlator (THC) method builds a Hankel matrix from the full correlator data available and truncates the eigenspectrum of…

High Energy Physics - Lattice · Physics 2025-10-20 Johann Ostmeyer , Carsten Urbach

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

Quantum Algebra · Mathematics 2010-01-20 W. Baratta

By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…

Number Theory · Mathematics 2019-02-14 Victor J. W. Guo , Wadim Zudilin

We review the closed-forms of the partial Fourier sums associated with $HP_k(n)$ and create an asymptotic expression for $HP(n)$ as a way to obtain formulae for the full Fourier series (if $b$ is such that $|b|<1$, we get a surprising…

Number Theory · Mathematics 2021-04-02 Jose Risomar Sousa

For each positive integer n, we determine the set of symmetric functions f for which the congruence f(p/1,p/2,...,p/(p-1)) \equiv 0 mod p^n holds for all sufficiently large primes p. Our determination is conditional on a conjecture…

Number Theory · Mathematics 2015-01-13 Julian Rosen

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

Computational Complexity · Computer Science 2012-02-17 Bruno Grenet , Pascal Koiran , Natacha Portier , Yann Strozecki
‹ Prev 1 8 9 10 Next ›