Live briefing
Everything about Sidon sequence
Class of sequences of natural numbers
In number theory, a Sidon sequence is a sequence of natural numbers in which all pairwise sums (for ) are different. Sidon sequences are also called Sidon sets; they are named after the Hungarian mathematician Simon Sidon, who introduced the concept in his investigations of Fourier series. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sidon sequenceA 5-minute orientation
- Skim a recent paper: Dense sumsets of Sidon sequencesInfluential work since 2022
- Read the landmark paper: A Dense Infinite Sidon SequenceCited 92 times
- Go sideways: Sum-free setA closely related topic
- Go sideways: Schnirelmann densityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A Dense Infinite Sidon Sequence
An Infinite Sidon Sequence
Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence
On Finite Sidon Sequences
Infinite Sidon sequences
On sums of a Sidon-sequence
Construction of QC-LDPC Codes from Sidon Sequence Using Permutation and Segmentation
Random Sidon Sequences
🆕 Influential since 2022
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Sum-free set In additive combinatorics and number theory, a subset A of an abelian group G is said to be sum-free if the sumset A + A is disjoint from A. In other words…
- Schnirelmann density In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Soviet…
- Landau's problems At the 1912 International Congress of Mathematicians, Edmund Landau listed four basic problems about prime numbers. These problems were characterised in…
- Stanley sequence In mathematics, a Stanley sequence is an integer sequence generated by a greedy algorithm that chooses the sequence members to avoid arithmetic progressions…
- Square-difference-free set In mathematics, a square-difference-free set is a set of natural numbers, no two of which differ by a square number. Hillel Furstenberg and András Sárközy…
- Quasirandom group In mathematics, a quasirandom group is a group that does not contain a large product-free[clarification needed] subset. Such groups are precisely those…
- Restricted sumset In additive number theory and combinatorics, a restricted sumset has the form S = { a 1 + ⋯ + a n : a 1 ∈ A 1 , … , a n ∈ A n a n d P ( a 1 , ……
- Zero-sum problem In number theory, zero-sum problems are certain kinds of combinatorial problems about the structure of a finite abelian group. Concretely, given a finite…