SearcharxivSearch

arXiv subjects

Mark Lewko

Publications and source records attributed to Mark Lewko.

At least 19 recordsLinked to original sources

A bilinear approach to the finite field restriction problem, II

Let $P_3$ denote the three-dimensional paraboloid over a finite field of prime order in which $-1$ is not a square. We prove that the Fourier extension operator associated with $P_3$ maps $L^2$ to $L^r$ for $r>\frac{176}{51}=3.45098\ldots$. The argument combines the author's bilinear approach to the problem with point-line incidence estimates. We also prove that the extension operator associated with the paraboloid $P_6$ in six dimensions maps $L^2$ to $L^{8/3}$. This was previously known up to but not including the endpoint, and is the sharp $L^2$ estimate in six dimensions. Finally we observe that the endpoint restriction conjecture for $P_3$ in finite fields implies that the integer lattice points on the $3$-d Euclidean paraboloid are a $\Lambda(3)$ set.

math.CA

The Sidon Decomposition Problem in Abelian Groups of Bounded Torsion

Let $G$ be a compact abelian group whose dual group $\Gamma=\widehat{G}$ has bounded torsion. In 1967, Malliavin-Brameret and Malliavin proved that every Sidon set in $\Gamma$ is a finite union of quasi-independent sets when $\Gamma$ has prime exponent. This was later extended to squarefree exponents in work of Varopoulos and Bourgain. We prove the remaining bounded-torsion case. Consequently, if $\widehat{G}$ has bounded torsion, then a subset $\Lambda\subset \widehat{G}\setminus{0}$ is Sidon if and only if it is a finite union of quasi-independent sets.

math.CA

A Fourier-Free Density-Increment Proof of Roth's Theorem

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over sub-progressions.

math.CO

An improved non-linear Roth-type theorem in finite fields

Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, this improves the previous best-known exponent of $7/8$, due to Kavrut and Wu. Unlike some of the previous papers, which rely on Katz's deep multivariate exponential-sum estimates, our argument uses only one-variable Weil-type estimates. We also construct, over certain non-prime finite fields, progression-free sets of size $c|F|^{2/3}$. A key idea in the proof was suggested to the author by ChatGPT 5.5.

math.NT

A bilinear approach to the finite field restriction problem

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx 3.555$. In contrast with much of the recent progress on this problem, our argument does not use state-of-the-art incidence estimates but rather proceeds by obtaining estimates on a related bilinear operator. These estimates are based on a geometric result that, roughly speaking, states that a set of points in the finite plane $F^2$ can be decomposed as a union of sets each of which either contains a controlled number of rectangles or a controlled number of trapezoids.

math.CA

Counting rectangles and an improved restriction estimate for the paraboloid in $F_p^3$

Given $A \subset F_{p}^2$ a sufficiently small set in the plane over a prime residue field, we prove that there are at most $O_\epsilon (|A|^{\frac{99}{41}+\epsilon})$ rectangles with corners in $A$. The exponent $\frac{99}{41} = 2.413\ldots$ improves slightly on the exponent of $\frac{17}{7} = 2.428\ldots$ due to Rudnev and Shkredov. Using this estimate we prove that the extension operator for the three dimensional paraboloid in prime order fields maps $L^2 \rightarrow L^{r}$ for $r >\frac{188}{53}=3.547\ldots$ improving the previous range of $r\geq \frac{32}{9}= 3.\overline{555}$.

math.CA

An explicit two-source extractor with min-entropy rate near 4/9

In 2005 Bourgain gave the first explicit construction of a two-source extractor family with min-entropy rate less than $1/2$. His approach combined Fourier analysis with innovative but inefficient tools from arithmetic combinatorics and yielded an unspecified min-entropy rate which was greater than $.499$. This remained essentially the state of the art until a 2015 breakthrough of Chattopadhyay and Zuckerman in which they gave an alternative approach which produced extractors with arbitrarily small min-entropy rate. In the current work, we revisit the Fourier analytic approach. We give an improved analysis of one of Bourgain's extractors which shows that it in fact extracts from sources with min-entropy rate near $\frac{21}{44} =.477\ldots$, moreover we construct a variant of this extractor which we show extracts from sources with min-entropy rate near $4/9 $ = $.444\ldots$. While this min-entropy rate is inferior to Chattopadhyay and Zuckerman's construction, our extractors have the advantage of exponential small error which is important in some applications. The key ingredient in these arguments is recent progress connected to the restriction theory of the finite field paraboloid by Rudnev and Shkredov. This in turn relies on a Rudnev's point-plane incidence estimate, which in turn relies on Koll\'ar's generalization of the Guth-Katz incidence theorem.

math.CO

Finite field restriction estimates for the paraboloid in high even dimensions

We prove that the finite field Fourier extension operator for the paraboloid is bounded from $L^2\to L^r$ for $r\geq \frac{2d+4}{d}$ in even dimensions $d\ge 8$, which is the optimal $L^2$ estimate. For $d=6$ we obtain the optimal range $r> \frac{2d+4}{d}=8/3$, apart from the endpoint. For $d=4$ we improve the prior range of $r>16/5=3.2$ to $r\geq 28/9=3.111\ldots$, compared to the conjectured range of $r\geq3$. The key new ingredient is improved additive energy estimates for subsets of the paraboloid.

math.CA

Additive Energy and the Hausdorff dimension of the exceptional set in metric pair correlation problems

For a sequence of integers $\{a(x)\}_{x \geq 1}$ we show that the distribution of the pair correlations of the fractional parts of $\{ \langle \alpha a(x) \rangle \}_{x \geq 1}$ is asymptotically Poissonian for almost all $\alpha$ if the additive energy of truncations of the sequence has a power savings improvement over the trivial estimate. Furthermore, we give an estimate for the Hausdorff dimension of the exceptional set as a function of the density of the sequence and the power savings in the energy estimate. A consequence of these results is that the Hausdorff dimension of the set of $\alpha$ such that $\{\langle \alpha x^d \rangle\}$ fails to have Poissonian pair correlation is at most $\frac{d+2}{d+3} < 1$. This strengthens a result of Rudnick and Sarnak which states that the exceptional set has zero Lebesgue measure. On the other hand, classical examples imply that the exceptional set has Hausdorff dimension at least $\frac{2}{d+1}$. An appendix by Jean Bourgain was added after the first version of this paper was written. In this appendix two problems raised in the paper are solved.

math.NT

Sidonicity and variants of Kaczmarz's problem

We prove that a uniformly bounded system of orthonormal functions satisfying the $\psi_2$ condition: (1) must contain a Sidon subsystem of proportional size, (2) must satisfy the Rademacher-Sidon property, and (3) must have its 5-fold tensor satisfy the Sidon property. On the other hand, we construct a uniformly bounded orthonormal system that satisfies the $\psi_2$ condition but which is not Sidon. These problems are variants of Kaczmarz's Scottish book problem (problem 130) which, in its original formulation, was answered negatively by Rudin. A corollary of our argument is a new, elementary proof of Pisier's theorem that a set of characters satisfying the $\psi_2$ condition is Sidon.

math.CA

Refinements of G\'al's theorem and applications

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem, which is new. Our approach also gives a transparent explanation of the relationship between the maximal size of the Riemann zeta function on vertical lines and bounds on GCD sums; a point which was previously unclear. Furthermore we obtain sharp bounds on the spectral norm of GCD matrices which settles a question raised in [2]. We use bounds for the spectral norm to show that series formed out of dilates of periodic functions of bounded variation converge almost everywhere if the coefficients of the series are in $L^2 (\log\log 1/L)^{\gamma}$, with $\gamma > 2$. This was previously known with $\gamma >4$, and is known to fail for $\gamma<2$. We also develop a sharp Carleson-Hunt-type theorem for functions of bounded variations which settles another question raised in [1]. Finally we obtain almost sure bounds for partial sums of dilates of periodic functions of bounded variations improving [1]. This implies almost sure bounds for the discrepancy of $\{n_k x\}$ with $n_k$ an arbitrary growing sequences of integers.

math.NT

Finite field restriction estimates based on Kakeya maximal operator estimates

In the finite field setting, we show that the restriction conjecture associated to any one of a large family of $d=2n+1$ dimensional quadratic surfaces implies the $n+1$ dimensional Kakeya conjecture (Dvir's theorem). This includes the case of the paraboloid over finite fields in which $-1$ \emph{is} a square. We are able to partially reverse this implication using the sharp Kakeya maximal operator estimates of Ellenberg, Oberlin and Tao to establish the first finite field restriction estimates beyond the Stein-Tomas exponent in this setting.

math.CA

New Restriction Estimates for the 3-d Paraboloid over Finite Fields

We improve the range of exponents for the restriction problem for the 3-d paraboloid over finite fields. The key new ingredient is a variant of the Bourgain-Katz-Tao finite field incidence theorem derived from sum-product estimates. In prime order fields, we give an explicit relationship between the exponent in this incidence theorem and restriction estimates for the paraboloid.

math.CA

On the Complexity of Asynchronous Agreement Against Powerful Adversaries

We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a \emph{strongly adaptive adversary} that is computationally unbounded and has a limited ability to corrupt a dynamic subset of processors by erasing their memories. We demonstrate that the randomized agreement algorithms designed by Ben-Or and Bracha to tolerate crash or Byzantine failures in the asynchronous setting extend to defeat a strongly adaptive adversary. These algorithms have essentially perfect correctness and termination, but at the expense of exponential running time. In the case of the strongly adaptive adversary, we show that this dismally slow running time is \emph{inherent}: we prove that any algorithm with essentially perfect correctness and termination against the strongly adaptive adversary must have exponential running time. We additionally interpret this result as yielding an enhanced understanding of the tools needed to simultaneously achieving perfect correctness and termination as well as fast running time for randomized algorithms tolerating crash or Byzantine failures.

cs.DC

The Square Variation of Rearranged Fourier Series

We prove that there exists a rearrangement of the first $N$ elements of the trigonometric system such that the $L^2$-norm of the square variation operator is at most $O_{\epsilon}(\log^{9/22+\epsilon}(N))$. This is an improvement over $O(\log^{1/2}(N))$ from the canonical ordering.

math.CA

Orthonormal Systems in Linear Spans

We show that any $N$-dimensional linear subspace of $L^2(\mathbb{T})$ admits an orthonormal system such that the $L^2$ norm of the square variation operator $V^2$ is as small as possible. When applied to the span of the trigonometric system, we obtain an orthonormal system of trigonometric polynomials with a $V^2$ operator that is considerably smaller than the associated operator for the trigonometric system itself.

math.CA

A Variational Barban-Davenport-Halberstam Theorem

We prove variational forms of the Barban-Davenport-Halberstam Theorem and the large sieve inequality. We apply our result to prove an estimate for the sum of the squares of prime differences, averaged over arithmetic progressions.

math.NT