skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.


Title: Paucity problems and some relatives of Vinogradov’s mean value theorem
Abstract When$$k\geqslant 4$$and$$0\leqslant d\leqslant (k-2)/4$$, we consider the system of Diophantine equations\begin{align*}x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\leqslant j\leqslant k,\, j\ne k-d).\end{align*}We show that in this cousin of a Vinogradov system, there is a paucity of non-diagonal positive integral solutions. Our quantitative estimates are particularly sharp when$$d=o\!\left(k^{1/4}\right)$$.  more » « less
Award ID(s):
2001549 1854398
PAR ID:
10507210
Author(s) / Creator(s):
Publisher / Repository:
Cambridge University Press
Date Published:
Journal Name:
Mathematical Proceedings of the Cambridge Philosophical Society
Volume:
175
Issue:
2
ISSN:
0305-0041
Page Range / eLocation ID:
327 to 343
Subject(s) / Keyword(s):
Paucity Vinogradov's mean value theorem
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract The purpose of this paper is to introduce and study the following graph-theoretic paradigm. Let$$ \begin{align*}T_Kf(x)=\int K(x,y) f(y) d\mu(y),\end{align*} $$where$$f: X \to {\Bbb R}$$,Xa set, finite or infinite, andKand$$\mu $$denote a suitable kernel and a measure, respectively. Given a connected ordered graphGonnvertices, consider the multi-linear form$$ \begin{align*}\Lambda_G(f_1,f_2, \dots, f_n)=\int_{x^1, \dots, x^n \in X} \ \prod_{(i,j) \in {\mathcal E}(G)} K(x^i,x^j) \prod_{l=1}^n f_l(x^l) d\mu(x^l),\end{align*} $$where$${\mathcal E}(G)$$is the edge set ofG. Define$$\Lambda _G(p_1, \ldots , p_n)$$as the smallest constant$$C>0$$such that the inequality(0.1)$$ \begin{align} \Lambda_G(f_1, \dots, f_n) \leq C \prod_{i=1}^n {||f_i||}_{L^{p_i}(X, \mu)} \end{align} $$holds for all nonnegative real-valued functions$$f_i$$,$$1\le i\le n$$, onX. The basic question is, how does the structure ofGand the mapping properties of the operator$$T_K$$influence the sharp exponents in (0.1). In this paper, this question is investigated mainly in the case$$X={\Bbb F}_q^d$$, thed-dimensional vector space over the field withqelements,$$K(x^i,x^j)$$is the indicator function of the sphere evaluated at$$x^i-x^j$$, and connected graphsGwith at most four vertices. 
    more » « less
  2. Abstract Letfbe an$$L^2$$-normalized holomorphic newform of weightkon$$\Gamma _0(N) \backslash \mathbb {H}$$withNsquarefree or, more generally, on any hyperbolic surface$$\Gamma \backslash \mathbb {H}$$attached to an Eichler order of squarefree level in an indefinite quaternion algebra over$$\mathbb {Q}$$. Denote byVthe hyperbolic volume of said surface. We prove the sup-norm estimate$$\begin{align*}\| \Im(\cdot)^{\frac{k}{2}} f \|_{\infty} \ll_{\varepsilon} (k V)^{\frac{1}{4}+\varepsilon} \end{align*}$$ with absolute implied constant. For a cuspidal Maaß newform$$\varphi $$of eigenvalue$$\lambda $$on such a surface, we prove that$$\begin{align*}\|\varphi \|_{\infty} \ll_{\lambda,\varepsilon} V^{\frac{1}{4}+\varepsilon}. \end{align*}$$ We establish analogous estimates in the setting of definite quaternion algebras. 
    more » « less
  3. Abstract Let$$\varphi _1,\ldots ,\varphi _r\in {\mathbb Z}[z_1,\ldots z_k]$$be integral linear combinations of elementary symmetric polynomials with$$\text {deg}(\varphi _j)=k_j\ (1\le j\le r)$$, where$$1\le k_1<\cdots . Subject to the condition$$k_1+\cdots +k_r\ge \tfrac {1}{2}k(k-~1)+2$$, we show that there is a paucity of nondiagonal solutions to the Diophantine system$$\varphi _j({\mathbf x})=\varphi _j({\mathbf y})\ (1\le j\le r)$$. 
    more » « less
  4. Abstract For every$$n\geq 2$$, Bourgain’s constant$$b_n$$is the largest number such that the (upper) Hausdorff dimension of harmonic measure is at most$$n-b_n$$for every domain in$$\mathbb {R}^n$$on which harmonic measure is defined. Jones and Wolff (1988,Acta Mathematica161, 131–144) proved that$$b_2=1$$. When$$n\geq 3$$, Bourgain (1987,Inventiones Mathematicae87, 477–483) proved that$$b_n>0$$and Wolff (1995,Essays on Fourier analysis in honor of Elias M. Stein (Princeton, NJ, 1991), Princeton University Press, Princeton, NJ, 321–384) produced examples showing$$b_n<1$$. Refining Bourgain’s original outline, we prove that$$\begin{align*}b_n\geq c\,n^{-2n(n-1)}/\ln(n),\end{align*}$$for all$$n\geq 3$$, where$$c>0$$is a constant that is independent ofn. We further estimate$$b_3\geq 1\times 10^{-15}$$and$$b_4\geq 2\times 10^{-26}$$. 
    more » « less
  5. Abstract A result of Gyárfás [12] exactly determines the size of a largest monochromatic component in an arbitrary$$r$$-colouring of the complete$$k$$-uniform hypergraph$$K_n^k$$when$$k\geq 2$$and$$k\in \{r-1,r\}$$. We prove a result which says that if one replaces$$K_n^k$$in Gyárfás’ theorem by any ‘expansive’$$k$$-uniform hypergraph on$$n$$vertices (that is, a$$k$$-uniform hypergraph$$G$$on$$n$$vertices in which$$e(V_1, \ldots, V_k)\gt 0$$for all disjoint sets$$V_1, \ldots, V_k\subseteq V(G)$$with$$|V_i|\gt \alpha$$for all$$i\in [k]$$), then one gets a largest monochromatic component of essentially the same size (within a small error term depending on$$r$$and$$\alpha$$). As corollaries we recover a number of known results about large monochromatic components in random hypergraphs and random Steiner triple systems, often with drastically improved bounds on the error terms. Gyárfás’ result is equivalent to the dual problem of determining the smallest possible maximum degree of an arbitrary$$r$$-partite$$r$$-uniform hypergraph$$H$$with$$n$$edges in which every set of$$k$$edges has a common intersection. In this language, our result says that if one replaces the condition that every set of$$k$$edges has a common intersection with the condition that for every collection of$$k$$disjoint sets$$E_1, \ldots, E_k\subseteq E(H)$$with$$|E_i|\gt \alpha$$, there exists$$(e_1, \ldots, e_k)\in E_1\times \cdots \times E_k$$such that$$e_1\cap \cdots \cap e_k\neq \emptyset$$, then the smallest possible maximum degree of$$H$$is essentially the same (within a small error term depending on$$r$$and$$\alpha$$). We prove our results in this dual setting. 
    more » « less