Linear problems in combinatorial number theory
In many problems of combinatorial number theory one has to estimate the density of a sequence of positive integers, where the only restriction on the sequence is that some linear relations do not hold for its subsets. One such problem is the Sidon problem. A sequence \(a_i\) (finite or infinite) is called a \(B_2\)-sequence if every integer can be written in at most one way in the form \(a_i+a_j\). Let \(F_2(n)\) denote the largest number \(k\) for which there exists a \(B_2\)-sequence \(a_1<a_2<\dots <a_k\leq n\). It is known that \(F_2(n)\sim \sqrt n\). Another problem of similar nature is the following: How many numbers \(r _k(n)\) can be chosen from the first \(n\) integers not containing an arithmetic progression of \(k\) terms. It is known that \(r _k(n)>n^{1-\varepsilon/\sqrt{\log n}}\). One can ask the question for arbitrary \(n\) integers (not necessarily the first \(n\)). The results in this direction are much weaker. In the case of the Sidon problem the corresponding lower bound is only \(n^{1/3}\), for the problem of arithmetic progression, no lower bound is known. However, one can expect that the case of the first \(n\) integers is ``the worst case. This is the statement the authors have formulated as a theorem (too long to be quoted here) and proved in this paper under very general circumstances.
- 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)
