arXiv subjects

Ákos Magyar

Publications and source records attributed to Ákos Magyar.

8 recordsLinked to original sources

arXiv2026

Quasipolynomial density bounds for $K$-point configurations in $\mathbb{Z}^d$

Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $Δ\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $Δ$. We prove that \[ |A|\ll_{Δ,d} N^d\exp\!\left(-c_{Δ,d}\sqrt{\log N}\right) \] improving upon a polylogarithmic bound due to Magyar. We perform a density increment argument using the circle method, and we introduce a ``cut operator'' method to decouple the weighted exponential sum over the system of quadratic forms describing the simplex. Our proof combines ideas from graph theory, functional analysis, and the geometry of numbers. In the process, we apply Finner's fractional form of Hölder's inequality, the analytic large sieve, and Kim's mean value formula for primitive lattice flags.

math.NT↗

arXiv2026

The Furstenberg-Sárközy theorem for sums of an even number of odd powers

We obtain a Furstenberg-Sárközy-type result for sets $A\subset [N]$ whose difference set $A-A$ does not contain the sum of $s$-many $k$-th powers of positive integers, with $k>1$ odd and $s>0$ even. Namely, we prove that such sets must satisfy a power-saving bound $|A| \, \ll \, N^{1-\frac1k\min\{s \, σ_k, \, 1/2\}+ε}$ for any fixed $ε>0$, where $σ_k >0 $ is any admissible saving in a classical one-variable Weyl estimate. In particular, we can take $σ_k=\max\left\{2^{1-k}, \, \frac{1}{k(k-1)}\right\}$ using the classical theory and the best currently available bounds for classical Weyl sums. A greedy construction produces a set $A\subset[N]$ with $|A|\gg N^{1-s/k}$ for which $A-A$ contains no sum of $s$-many positive $k$-th powers, so our power-saving bound is of the correct shape.

math.NT↗

arXiv2025

Polynomial configurations in dense subsets of the prime lattice

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive relative upper density. We show that A contains all polynomial configurations of the form $x+P_0(y)v_0,\ldots, x+P_l(y)v_l$, for some $x$ in $\mathbb{Z}^d$ and $y$ in $\mathbb{N}$, which satisfy a certain non-degeneracy condition. We also obtain quantitative bounds on the size of such polynomial configuration, if $A$ is a subset of the first $N$ positive integers.

math.NT↗

arXiv2023

A Multidimensional Szemerédi Theorem in the primes

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of Green and Tao on the existence of long arithmetic progressions in the primes. The proof uses the hypergraph approach by assigning a pseudo-random weight system to the pattern $F$ on a $d+1$-partite hypergraph; a novel feature being that the hypergraph is no longer uniform with weights attached to lower dimensional edges. Then, instead of using a transference principle, we proceed by extending the proof of the so-called hypergraph removal lemma to our settings, relying only on the linear forms condition of Green and Tao.

math.NT↗

arXiv2022

Polynomial averages and pointwise ergodic theorems on nilpotent groups

We establish pointwise almost everywhere convergence for ergodic averages along polynomial sequences in nilpotent groups of step two of measure-preserving transformations on $σ$-finite measure spaces. We also establish corresponding maximal inequalities on $L^p$ for $1<p\leq \infty$ and $ρ$-variational inequalities on $L^2$ for $2<ρ<\infty$. This gives an affirmative answer to the Furstenberg-Bergelson-Leibman conjecture in the linear case for all polynomial ergodic averages in discrete nilpotent groups of step two. Our proof is based on almost-orthogonality techniques that go far beyond Fourier transform tools, which are not available in the non-commutative, nilpotent setting. In particular, we develop what we call a nilpotent circle method that allows us to adapt some of the ideas of the classical circle method to the setting of nilpotent groups.

math.DS↗

arXiv2016

A Roth type theorem for dense subsets of $\mathbb{R}^d$

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such that $\{x,x+y,x+2y\}\subs A$ and $|y|_p=\la$, where $||y||_p=(\sum_i |y_i|^p)^{1/p}$ is the $l^p(\mathbb R^d)$-norm of a point $y=(y_1,\ldots,y_d)\in\R^d$. This means that dense subsets of $\R^d$ contain 3-term progressions of all sufficiently large gaps when the gap size is measured in the $l^p$-metric. This statement is known to be false in the Euclidean $l^2$-metric as well as in the $l^1$ and $\ell^{\infty}$-metrics. One of the goals of this note is to understand this phenomenon. A distinctive feature of the proof is the use of multilinear singular integral operators, widely studied in classical time-frequency analysis, in the estimation of forms counting configurations.

math.CO↗

arXiv2013

Diophantine equations in the primes

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local to global type statement is shown via classical Hardy-Littlewood type methods which provides sufficient conditions for the solubility of $\mathfrak{p}(\mathbf{x})=\mathbf{s}$ under the condition that each of the $x_i$'s is prime.

math.NT↗

arXiv2013

Corners in dense subsets of P^d

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$ where x is an integer point and e_1,...,e_d are the standard basis vectors of the d-dimensional Euclidean space. Our argument is based on proving a removal lemma for weighted uniform hypergraphs, where the weight system is defined in terms of a pairwise linearly independent family of linear forms.

math.NT↗