Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Given $$h,g \in {\mathbb {N}}$$ h , g ∈ N , we write a set $$X \subset {\mathbb {Z}}$$ X ⊂ Z to be a $$B_{h}^{+}[g]$$ B h + [ g ] set if for any $$n \in {\mathbb {Z}}$$ n ∈ Z , the number of solutions to the additive equation $$n = x_1 + \dots + x_h$$ n = x 1 + ⋯ + x h with $$x_1, \dots , x_h \in X$$ x 1 , ⋯ , x h ∈ X is at most g, where we consider two such solutions to be the same if they differ only in the ordering of the summands. We define a multiplicative $$B_{h}^{\times }[g]$$ B h × [ g ] set analogously. In this paper, we prove, amongst other results, that there exist absolute constants $$g \in {\mathbb {N}}$$ g ∈ N and $$\delta >0$$ δ > 0 such that for any $$h \in {\mathbb {N}}$$ h ∈ N and for any finite set A of integers, the largest $$B_{h}^{+}[g]$$ B h + [ g ] set B inside A and the largest $$B_{h}^{\times }[g]$$ B h × [ g ] set C inside A satisfy $$\begin{aligned} \max \{ |B|, |C| \} \gg _{h} |A|^{(1+ \delta )/h }. \end{aligned}$$ max { | B | , | C | } ≫ h | A | ( 1 + δ ) / h . In fact, when $$h=2$$ h = 2 , we may set $$g = 31$$ g = 31 , and when h is sufficiently large, we may set $$g = 1$$ g = 1 and $$\delta \gg (\log \log h)^{1/2 - o(1)}$$ δ ≫ ( log log h ) 1 / 2 - o ( 1 ) . The former makes progress towards a recent conjecture of Klurman–Pohoata and quantitatively strengthens previous work of Shkredov.
Given $$h,g \in {\mathbb {N}}$$ h , g ∈ N , we write a set $$X \subset {\mathbb {Z}}$$ X ⊂ Z to be a $$B_{h}^{+}[g]$$ B h + [ g ] set if for any $$n \in {\mathbb {Z}}$$ n ∈ Z , the number of solutions to the additive equation $$n = x_1 + \dots + x_h$$ n = x 1 + ⋯ + x h with $$x_1, \dots , x_h \in X$$ x 1 , ⋯ , x h ∈ X is at most g, where we consider two such solutions to be the same if they differ only in the ordering of the summands. We define a multiplicative $$B_{h}^{\times }[g]$$ B h × [ g ] set analogously. In this paper, we prove, amongst other results, that there exist absolute constants $$g \in {\mathbb {N}}$$ g ∈ N and $$\delta >0$$ δ > 0 such that for any $$h \in {\mathbb {N}}$$ h ∈ N and for any finite set A of integers, the largest $$B_{h}^{+}[g]$$ B h + [ g ] set B inside A and the largest $$B_{h}^{\times }[g]$$ B h × [ g ] set C inside A satisfy $$\begin{aligned} \max \{ |B|, |C| \} \gg _{h} |A|^{(1+ \delta )/h }. \end{aligned}$$ max { | B | , | C | } ≫ h | A | ( 1 + δ ) / h . In fact, when $$h=2$$ h = 2 , we may set $$g = 31$$ g = 31 , and when h is sufficiently large, we may set $$g = 1$$ g = 1 and $$\delta \gg (\log \log h)^{1/2 - o(1)}$$ δ ≫ ( log log h ) 1 / 2 - o ( 1 ) . The former makes progress towards a recent conjecture of Klurman–Pohoata and quantitatively strengthens previous work of Shkredov.
Let p be a prime, let $s \geq 3$ be a natural number and let $A \subseteq \mathbb{F}_p$ be a non-empty set satisfying $|A| \ll p^{1/2}$. Denoting $J_s(A)$ to be the number of solutions to the system of equations $$ \sum_{i=1}^{s} (x_i - x_{i+s}) = \sum_{i=1}^{s} (x_i^2 - x_{i+s}^2) = 0, $$ with $x_1, \dots, x_{2s} \in A$, our main result implies that $$ J_s(A) \ll |A|^{2s - 2 - 1/9}. $$ This can be seen as a finite field analogue of the quadratic Vinogradov mean value theorem. Our techniques involve a variety of combinatorial geometric estimates, including studying incidences between Cartesian products A × A and a special family of modular hyperbolae.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.