Finding large additive and multiplicative Sidon sets in sets of integers
From MaRDI portal
Publication:6663187
DOI10.1007/S00208-024-02932-7MaRDI QIDQ6663187
Publication date: 14 January 2025
Published in: Mathematische Annalen (Search for Journal in Brave)
Special sequences and polynomials (11B83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding multiplicative energy by the sumset
- Theorems in the additive theory of numbers
- A modular Szemerédi-Trotter theorem for hyperbolas
- On incidence bounds with Möbius hyperbolae in positive characteristic
- Query complexity and the polynomial Freiman-Ruzsa conjecture
- New proofs of Plünnecke-type estimates for product sets in groups
- New bounds in Balog-Szemerédi-Gowers theorem
- Generalized multiplicative Sidon sets
- A theorem in finite projective geometry and some applications to number theory.
- The number of squares and \(B_h[g]\) sets
- A low-energy decomposition theorem
- Linear problems in combinatorial number theory
- On the size of $k$-fold sum and product sets of integers
- An update on the sum-product problem
- The History of Degenerate (Bipartite) Extremal Graph Problems
- A Note on Bipartite Graphs Without 2 k -Cycles
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- Upper and lower bounds on the size of $B_k[g]$ sets
- Additive and multiplicative Sidon sets
- New upper bounds for finite \(B_h\) sequences
- An Upper Bound on the Size of Sidon Sets
- Arithmetic Progressions in Sparse Sets
- On an application of higher energies to Sidon sets
This page was built for publication: Finding large additive and multiplicative Sidon sets in sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663187)
