Linear problems in combinatorial number theory
From MaRDI portal
Recommendations
Cites work
Cited in
(25)- On distinct distances among points in general position and other related problems
- Sidon sets in groups and induced subgraphs of Cayley graphs
- An application of graph theory to additive number theory
- Construction techniques for some thin sets in duals of compact abelian groups
- On some metric and combinatorial geometric problems
- Some applications of Ramsey's theorem to additive number theory
- Non-averaging subsets and non-vanishing transversals
- Finding large co-Sidon subsets in sets with a given additive energy
- On non-averaging sets of integers
- Sum-Free Sets of Integers
- scientific article; zbMATH DE number 1053217 (Why is no real title available?)
- Difference sets and positive exponential sums. I: General properties
- A note on distinct distances
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Distinct volume subsets
- Behrend-type constructions for sets of linear equations
- scientific article; zbMATH DE number 7674533 (Why is no real title available?)
- Additive and multiplicative Sidon sets
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
- Four‐term progression free sets with three‐term progressions in all large subsets
- On the multiplicative Chung-Diaconis-Graham process
- Unbounded expansion of polynomials and products
- Finding large additive and multiplicative Sidon sets in sets of integers
- Maximal subsets free of arithmetic progressions in arbitrary sets
- Separating hash families with large universe
This page was built for publication: Linear problems in combinatorial number theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4059030)