相关论文: Boyd's conjecture

Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

Given any positive integer $n,$ let $A(n)$ denote the height of the $n^{\text{th}}$ cyclotomic polynomial, that is its maximum coefficient in absolute value. It is well known that $A(n)$ is unbounded. We conjecture that every natural number…

Let $X_1,\ldots,X_n$ be a sequence of independent random points in $\mathbb{R}^d$ with common Lebesgue density $f$. Under some conditions on $f$, we obtain a Poisson limit theorem, as $n \to \infty$, for the number of large probability…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

We study the series s(n,x) which is the sum for k from 1 to n of the square of the sine of the product x Gamma(k)/k, where x is a variable. By Wilson's theorem we show that the integer part of s(n,x) for x = Pi/2 is the number of primes…

Let $a,b,c$ be non-zero integers and $f(x)=ax^n+bx^m+c$ be a trinomial of degree $n$. We surveyed the irreducibility criteria of $f(x)$ over rational numbers.

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\,(\text{mod } n)$ for $b,n\in\mathbb{Z}$. By $(a,b)_s$, we mean the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$ simultaneously. For each $d_j|n$, define…

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…