相关论文: The distribution of $k$-free numbers

We obtain lower bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta function for all k > 1. Previously such lower bounds were known only for rational values of k, with the bounds depending on the height of the…

Conditionally on the Riemann Hypothesis we obtain bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta-function for all positive real k < 2.181. This provides for the first time an upper bound of the correct…

We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the upper and lower bounds to a factor of $3+o(1)$. This improves…

In this paper, we will employ the Opial and Wirtinger type inequalities to derive some conditional and unconditional lower bounds for the gaps between the zeros of the Riemann zeta-function. First, we prove (unconditionally) that the…

It is shown that the sequence of rational numbers $r(k)$ generated by the ordinary generating function $\prod_{k=1}^\infty (1+x^k/k)$ converges to a limit $C > 0$. $C$ can be expressed as $C = \exp\Bigl(-\sum_{k = 2}^\infty…

Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…

In this paper we deduce a lower bound for the rank of a family of $p$ vectors in $\R^k$ (considered as a vector space over the rationals) from the existence of a sequence of linear forms on $\R^p$, with integer coefficients, which are small…

We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \ge k^{s-2 +…

We prove that among 1 and the odd zeta values $\zeta(3)$, $\zeta(5)$, \ldots, $\zeta(s)$, at least $ 0.21 \sqrt{s}/\sqrt{\log s}$ are linearly independent over the rationals, for any sufficiently large odd integer $s$. This is the first…

We study lower bounds for the Riemann zeta function $\zeta(s)$ along vertical arithmetic progressions in the right-half of the critical strip. We show that the lower bounds obtained in the discrete case coincide, up to the constants in the…

Let $k\geq 1$ be an integer. Let $\delta_k(n)$ denote the maximum divisor of $n$ which is co-prime to $k$. We study the error term of the general $m$-th Riesz mean of the arithmetical function $\delta_k(n)$ for any positive integer $m \ge…

We settle a conjecture of Farmer and Ki in a stronger form. Roughly speaking we show that there is a positive proportion of small gaps between consecutive zeros of the zeta-function $\zeta(s)$ if and only if there is a positive proportion…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…

In order to well understand the behaviour of the Riemann zeta function inside the critical strip, we show; among other things, the Fourier expansion of the $\zeta^k(s)$ ($k \in \mathbb{N}$) in the half-plane $\Re s > 1/2$ and we deduce a…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

In this article, we obtain effective estimates for the error term $\Delta_{k}(x)$ for all integers $k \geq2$, and completely explicit estimates for integers $k \in [3,9]$. The explicit results improve the powers of $x$ appearing in the…

Let $\Delta^{(k)}(x)$ denote the error term of the $k$-free divisor problem for $k\geq 2$. In this paper we establish an asymptotic formula of the integral $\int_1^T|\Delta^{(k)}(x)|^2dx$ for each $k\geq 4.$

Form a random k-SAT formula on n variables by selecting uniformly and independently m=rn clauses out of all 2^k (n choose k) possible k-clauses. The Satisfiability Threshold Conjecture asserts that for each k there exists a constant r_k…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$,…