An Upper Bound for Weak B_k-Sets

DOI10.1137/18M1189439zbMATH Open1447.11012arXiv1611.06414OpenAlexW2962911461MaRDI QIDQ5232131FDOQ5232131

Authors: Tomasz Schoen, Ilya D. Shkredov 

Publication date: 29 August 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We prove that if $Asubseteq1,2,dots,N$ does not contain any solution to the equation $x_1+dots+x_k=y_1+dots+y_k$ with distinct $x_1,dots,x_k,y_1,dots,y_{k}inA$, then $|A|ll{k}^{3/2}{N}^{1/k}.$

Full work available at URL: https://arxiv.org/abs/1611.06414

Recommendations

• Upper and lower bounds on \(B_k^{+}\)-sets
• Upper and lower bounds on the size of \(B_k[g]\) sets
• An upper bound for \(B_{2}[g]\) sets
• Upper bounds for \(B_{h}[g]\)-sets with small \(h\)
• A new upper bound for \(B_2 [2]\) sets
• scientific article; zbMATH DE number 147013
• scientific article; zbMATH DE number 1229622
• Discretely weak \(P\)-sets
• A numerical note on upper bounds for \(B_2[g]\) sets
• scientific article; zbMATH DE number 6304347

zbMATH Keywords

setscombinatorial number theoryavoiding linear equationsweak Sidon sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Additive combinatorics
• Intersection Theorems for Systems of Sets
• A complete annotated bibliography of work related to Sidon sequences
• The number of squares and \(B_h[g]\) sets
• Solving a linear equation in a set of integers I
• On t-designs
• Intersection Properties of Systems of Finite Sets

Cited In (4)

• Title not available (Why is that?)
• Upper and lower bounds on \(B_k^{+}\)-sets
• Sidon sets for linear forms
• Improved bounds on sizes of generalized caps in \(AG(n,q)\)

This page was built for publication: An Upper Bound for Weak $B_k$-Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232131)