Abstract: Let be an integer. A set is a -fold Sidon set if has only trivial solutions to each equation of the form where , and . We prove that for any integer , a -fold Sidon set has at most elements. Indeed we prove that given any positive integers , any set that contains only trivial solutions to for each , has at most elements. On the other hand, for any we can exhibit positive integers and a set with , such that has only trivial solutions to for each .
Recommendations
Cites work
- A Survey of Problems in Combinatorial Number Theory
- A complete annotated bibliography of work related to Sidon sequences
- A translate of Bose-Chowla \(B_2\)-sets
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On hypergraphs of girth five
- Sidon sets in \(\mathbb N^d\)
- Solving a linear equation in a set of integers I
- Theorems in the additive theory of numbers
Cited in
(8)- On Grids in Point-Line Arrangements in the Plane
- A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
- The regularity method for graphs with few 4‐cycles
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- 𝑝-Rider sets are 𝑞-Sidon sets
- On grids in point-line arrangements in the plane
- On modular \(k\)-free sets
This page was built for publication: \(k\)-fold Sidon sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463053)