English
Related papers

Related papers: A sharp bound for the Stein-Wainger oscillatory in…

200 papers

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Metric Geometry · Mathematics 2021-07-15 Mariia Dospolova

We study the weighted Poincar\'e constant $C(p,w)$ of a probability density $p$ with weight function $w$ using integration methods inspired by Stein's method. We obtain a new version of the Chen-Wang variational formula which, as a…

Probability · Mathematics 2022-06-13 Gilles Germain , Yvik Swan

Let $f(x) \in \bbz[x]$ and consider the index divisibility set $D = \{n \in \bbn : n \mid f^n(0)\}$. We present a number of properties of $D$ in the case that $(f^n(0))_{n=1}^\infty$ is a rigid divisibility sequence, generalizing a number…

Number Theory · Mathematics 2017-09-27 T. Alden Gassert , Michael T. Urbanski

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

Symbolic Computation · Computer Science 2026-01-22 Boris Adamczewski , Alin Bostan , Xavier Caruso

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

Number Theory · Mathematics 2020-03-20 Changhao Chen , Igor E. Shparlinski

Let $D$ be an integral domain with quotient field $K$ and $\Omega$ a finite subset of $D$. McQuillan proved that the ring ${\rm Int}(\Omega,D)$ of polynomials in $K[X]$ which are integer-valued over $\Omega$, that is, $f\in K[X]$ such that…

Rings and Algebras · Mathematics 2018-10-03 G. Peruginelli

If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…

Combinatorics · Mathematics 2015-05-08 Kevin M. Woods

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…

Number Theory · Mathematics 2015-01-26 Victor Beresnevich , Vasili Bernik , Friedrich Götze

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Commutative Algebra · Mathematics 2021-08-05 Francesca Gandini

In the present paper, the simplest scalar ODE case is studied for polynomials $$ \dot{w}=f(w)=(w-e_0)\cdot\ldots\cdot(w-e_{d-1}) $$ of degree $d$ with $d$ simple complex zeros. The explicit solution by separation of variables and explicit…

Dynamical Systems · Mathematics 2025-04-30 Bernold Fiedler

Polynomial invariants of a group action often appear only in high degree, and in many representations the invariant ring imposes severe degree constraints before any nontrivial invariants can occur. In contrast, the larger class of unitary…

Representation Theory · Mathematics 2026-02-17 Josh Katz

We prove that for all p>1/2 there exists a constant $\gamma_p>0$ such that, for any symmetric measurable set of positive measure $E\subset \TT$ and for any $\gamma<\gamma_p$, there is an idempotent trigonometrical polynomial f satisfying…

Classical Analysis and ODEs · Mathematics 2008-10-16 Aline Bonami , Szilárd Gy. Révész

We show that every polynomial overring of the ring ${\rm Int}(\mathbb Z)$ of polynomials which are integer-valued over $\mathbb Z$ may be considered as the ring of polynomials which are integer-valued over some subset of $\hat{\mathbb{Z}}$,…

Commutative Algebra · Mathematics 2018-10-03 Jean-Luc Chabert , Giulio Peruginelli

Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…

Number Theory · Mathematics 2007-05-23 M. Kuenzer , E. Wirsing

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

Algebraic Geometry · Mathematics 2012-09-25 Yuri Burda , Askold Khovanskii

We examine a certain class of trilinear integral operators which incorporate oscillatory factors e^{iP}, where P is a real-valued polynomial, and prove smallness of such integrals in the presence of rapid oscillations.

Classical Analysis and ODEs · Mathematics 2011-07-14 Michael Christ , Diogo Oliveira e Silva

Classical results of Brent, Kuck and Maruyama (IEEE Trans. Computers 1973) and Brent (JACM 1974) show that any algebraic formula of size s can be converted to one of depth O(log s) with only a polynomial blow-up in size. In this paper, we…

Computational Complexity · Computer Science 2023-02-15 Hervé Fournier , Nutan Limaye , Guillaume Malod , Srikanth Srinivasan , Sébastien Tavenas

Let $P(k,n)$ be the set of products of $k$ factors from the set $\{1,\ldots , n\}.$ In 1955, Erd\H{o}s posed the problem of determining the order of magnitude of $|P (2, n)|$ and proved that $|P (2, n)| = o(n^2 )$ for $n \to\infty$. In…

Combinatorics · Mathematics 2025-04-01 Anna Margarethe Limbach , Robert Scheidweiler , Eberhard Triesch