Searcharxiv⌕ Search

arXiv subjects

Antal Balog

Publications and source records attributed to Antal Balog.

12 recordsLinked to original sources
arXiv2026

The integer hull of the set $\{(x,y)\in \mathbb{R}^2: xy\ge N\}$

The integer convex hull $I(H_N)$ of the set $H_N=\{(x,y)\in \mathbb{R}^2: xy\ge N\}$ is the convex hull of the lattice points in $H_N$. The vertices of $I(H_N)$ lie in the square $[1,N]^2$. Improving on a recent result of Alc\'antara et al. ~\cite{Santos} we show that the number of vertices of $I(H_N)$ is of order $N^{1/3}\log N$. We also show that the area of the part of $H_N \setminus I(H_N)$ that lies in the square $[1,N^{2/3}]^2$ is also of order $N^{1/3}\log N$.

math.CO↗
arXiv2019

Bykovskii-type theorem for the Picard manifold

We generalise a result of Bykovskii to the Gaussian integers and prove an asymptotic formula for the prime geodesic theorem in short intervals on the Picard manifold. Previous works show that individually the remainder is bounded by $O(X^{13/8+ε})$ and $O(X^{3/2+θ+ε})$, where $θ$ is the subconvexity exponent for quadratic Dirichlet $L$-functions over $\mathbb{Q}(i)$. By combining arithmetic methods with estimates for a spectral exponential sum and a smooth explicit formula, we obtain an improvement for both of these exponents. Moreover, by assuming two standard conjectures on $L$-functions, we show that it is possible to reduce the exponent below the barrier $3/2$ and get $O(X^{34/23+ε})$ conditionally. We also demonstrate a dependence of the remainder in the short interval estimate on the classical Gauss circle problem for shifted centres.

math.NT↗
arXiv2018

The prime geodesic theorem in square mean

We strengthen the recent result of Cherubini and Guerreiro on the square mean of the error term in the prime geodesic theorem for $\mathrm{PSL}_2(\mathbb{Z})$. We also develop a short interval version of this result.

math.NT↗
arXiv2016

Expanders with superquadratic growth

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log^{\frac{17}{16}}|A|}, \\ \left|\frac{A+A}{A+A}+\frac{A}{A}\right| &\gg \frac{|A|^{2+\frac{2}{17}}}{\log^{\frac{16}{17}}|A|}, \\ \left|\frac{AA+AA}{A+A}\right| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log |A|}, \\ \left|\frac{AA+A}{AA+A}\right| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log |A|}. \end{align*}

math.CO↗
arXiv2015

A low-energy decomposition theorem

We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.

math.NT↗
arXiv2014

Sum of dilates in vector spaces

Let $d\geq 2$, $A \subset \mathbb{Z}^d$ be finite and not contained in a translate of any hyperplane, and $q \in \mathbb{Z}$ such that $|q| > 1$. We show $$|A+ q \cdot A| \geq (|q|+d+1)|A| - O_{q,d}(1).$$

math.NT↗
arXiv2014

New sum-product estimates for real and complex numbers

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite set $A$ of positive real numbers, it is true that $$\left|\left\{\frac{a+b}{c+d}:a,b,c,d\in{A}\right\}\right|\geq{2|A|^2-1}.$$ As a consequence of this result, it is also established that $$|4^{k-1}A^{(k)}|:=|\underbrace{\underbrace{A\cdots{A}}_\textrm{k times}+\cdots{+A\cdots{A}}}_\textrm{$4^{k-1}$ times}|\geq{|A|^k}.$$ Later on, it is shown that both of these bounds hold in the case when $A$ is a finite set of complex numbers, although with smaller multiplicative constants.

math.CO↗
arXiv2013

On the Sum of Dilations of a Set

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

math.NT↗
arXiv2010

On the Number of Solutions of Exponential Congruences

For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence $x^x \equiv y^y \pmod p$, $1 \le x,y \le p-1$, which is of cryptographic relevance.

math.NT↗
arXiv2007

Average twin prime conjecture for elliptic curves

Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and Littlewood twin prime conjecture in the case of elliptic curves. Koblitz's conjecture is still widely open. In this paper we prove that Koblitz's conjecture is true on average over a two-parameter family of elliptic curves. One of the key ingredients in the proof is a short average distribution result in the style of Barban-Davenport-Halberstam, where the average is taken over twin primes and their differences.

math.NT↗