Andriy Bondarenko

Andriy Bondarenko
Are you Andriy Bondarenko?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Andriy Bondarenko
Affiliation
Location

Pubs By Year

Pub Categories

 
Mathematics - Number Theory (8)
 
Mathematics - Metric Geometry (6)
 
Mathematics - Numerical Analysis (5)
 
Mathematics - Functional Analysis (3)
 
Mathematics - Complex Variables (3)
 
Mathematics - Combinatorics (3)
 
Mathematics - General Mathematics (1)
 
Mathematics - Probability (1)

Publications Authored By Andriy Bondarenko

We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le T$ is at least $\exp\left((1+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. We also obtain conditional results for $S(t):=1/\pi$ times the argument of $\zeta(1/2+it)$ and $S_1(t):=\int_0^t S(\tau)d\tau$. Read More

We improve Montgomery's $\Omega$-results for $|\zeta(\sigma+it)|$ in the strip $1/2<\sigma<1$ and give in particular lower bounds for the maximum of $|\zeta(\sigma+it)|$ on $\sqrt{T}\le t \le T$ that are uniform in $\sigma$. We give similar lower bounds for the maximum of $|\sum_{n\le x} n^{-1/2-it}|$ on intervals of length much larger than $x$. We rely on our recent work on lower bounds for maxima of $|\zeta(1/2+it)|$ on long intervals, as well as work of Soundararajan, G\'{a}l, and others. Read More

We prove that \[ \sum_{k,{\ell}=1}^N\frac{(n_k,n_{\ell})^{2\alpha}}{(n_k n_{\ell})^{\alpha}} \ll N^{2-2\alpha} (\log N)^{b(\alpha)} \] holds for arbitrary integers $1\le n_1<\cdots < n_N$ and $0<\alpha<1/2$ and show by an example that this bound is optimal, up to the precise value of the exponent $b(\alpha)$. This estimate complements recent results for $1/2\le \alpha \le 1$ and shows that there is no "trace" of the functional equation for the Riemann zeta function in estimates for such GCD sums when $0<\alpha<1/2$. Read More

It is shown that the maximum of $|\zeta(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain large GCD sum. The method of proof shows that the absolute constant $A$ in the inequality \[ \sup_{1\le n_1<\cdots < n_N} \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N \exp\left(A\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right), \] established in a recent paper of ours, cannot be taken smaller than $1$. Read More

We consider the random functions $S_N(z):=\sum_{n=1}^N z(n) $, where $z(n)$ is the completely multiplicative random function generated by independent Steinhaus variables $z(p)$. It is shown that ${\Bbb E} |S_N|\gg \sqrt{N}(\log N)^{-0.05616}$ and that $({\Bbb E} |S_N|^q)^{1/q}\gg_{q} \sqrt{N}(\log N)^{-0. Read More

The $L^q$ norm of a Dirichlet polynomial $F(s)=\sum_{n=1}^{N} a_n n^{-s}$ is defined as \[\| F\|_q:=(\lim_{T\to\infty}\frac{1}{T}\int_{0}^T |F(it)|^qdt)^{1/q}\] for $0Read More

It is proved that \[ \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N\exp\left(C\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right) \] holds for arbitrary integers $1\le n_1<\cdots < n_N$. This bound is essentially better than that found in a recent paper of Aistleitner, Berkes, and Seip and can not be improved by more than possibly a power of $1/\sqrt{\log\log\log N}$. The proof relies on ideas from classical work of G\'{a}l, the method of Aistleitner, Berkes, and Seip, and a certain completeness property of extremal sets of square-free numbers. Read More

We answer Totik's question on weighted Bernstein's inequalities showing that $$ \|T_n'\|_{L_p(\omega)} \le C(p,\omega)\, {n}\,\|T_n\|_{L_p(\omega)},\qquad 0Read More

In this paper we answer Larman's question on Borsuk's conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere in the dimension 65 which cannot be partitioned into 83 parts of smaller diameter. This also reduces the smallest dimension in which Borsuk's conjecture is known to be false. Read More

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$. Read More

In this paper, we give a complete description of strongly regular graphs with parameters ((n^2+3n-1)^2,n^2(n+3),1,n(n+1)). All possible such graphs are: the lattice graph $L_{3,3}$ with parameters (9,4,1,2), the Brouwer-Haemers graph with parameters (81,20,1,6), and the Games graph with parameters (729,112,1,20). Read More

We obtain an analog of Shvedov theorem for convex multivariate approximation by algebras of continuous functions. Read More

In this paper we prove the conjecture of Korevaar and Meyers: for each $N\ge c_dt^d$ there exists a spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $c_d$ is a constant depending only on $d$. Read More

The following analog of Bernstein inequality for monotone rational functions is established: if $R$ is an increasing on $[-1,1]$ rational function of degree $n$, then $$ R'(x)<\frac{9^n}{1-x^2}\|R\|,\quad x\in (-1,1). $$ The exponential dependence of constant factor on $n$ is shown, with sharp estimates for odd rational functions. Read More

In this short note we propose a new method for construction new nice arrangement on the sphere $S^d$ using the spaces of spherical harmonic. Read More

For each N>=c_d*n^{2d*(d+1)/(d+2)} we prove the existence of a spherical n-design on S^d consisting of N points, where c_d is a constant depending only on $d$. Read More

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4, a_4 <= 7, a_5 <= 9, a_6 <= 11, a_7 <= 12, a_8 <= 16, a_9 <= 19, a_10 <= 22, and a_n < n/2*log_2(2n), n > 10. Read More