Upper and lower bounds on the size of $B_k[g]$ sets

zbMath1490.05265arXiv2105.03706MaRDI QIDQ5863480

Craig Timmons, Griffin Johnston, Michael Tait

Publication date: 1 June 2022

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

zbMATH Keywords

Sidon setsBerry-Esseen type theoremBose-Chowla sets

Mathematics Subject Classification ID

Extremal set theory (05D05) Special sequences and polynomials (11B83)

Cites Work

• Unnamed Item
• Unnamed Item
• Sidon sets and graphs without 4-cycles
• An improvement of convergence rate estimates in the Lyapunov theorem
• An upper bound for \(B_{2}[g\) sets]
• Theorems in the additive theory of numbers
• Norm-graphs: Variations and applications
• Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
• On finite Sidon sequences
• Upper and lower bounds for finite \(B_h[g\) sequences.]
• The density of \(B_ h[g\) sequences and the minimum of dense cosine sums]
• New asymptotics for bipartite Turán numbers
• Generalized Sidon sets
• Constructions of generalized Sidon sets.
• A complete annotated bibliography of work related to Sidon sequences
• The number of squares and B_h[g sets]
• Upper bounds for $B_h[g$-sets with small $h$]
• The Symmetric Subset Problem in Continuous Ramsey Theory
• B₂[g Sets and a Conjecture of Schinzel and Schmidt]
• On the Size of Finite Sidon Sequences
• $B_h[g$-sequences from $B_h$-sequences]
• B _h [ g sequences]
• B_{h}[g MODULAR SETS FROM B_{h} MODULAR SETS]
• The Zarankiewicz problem in 3‐partite graphs
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• A Note on the Erdös Distinct Subset Sums Problem

This page was built for publication: Upper and lower bounds on the size of $B_k[g]$ sets