Open problems in additive combinatorics
From MaRDI portal
Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70) Additive number theory; partitions (11P99) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite geometry and special incidence structures (51E99)
Recommendations
Cited in
(35)- A continuous model for systems of complexity 2 on simple abelian groups
- Some additive combinatorics problems in matrix rings
- The inverse sieve problem for algebraic varieties over global fields
- Gauss sums and the maximum cliques in generalized Paley graphs of square order
- On monochromatic solutions to x-y=z^2
- A uniform set with fewer than expected arithmetic progressions of length 4
- Groups with irreducibly unfaithful subsets for unitary representations
- On the interplay between additive and multiplicative largeness and its combinatorial applications
- The algebraicity of ill-distributed sets
- On the clique number of Paley graphs of prime power order
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- The inverse sieve problem in high dimensions
- New applications of the polynomial method: the cap set conjecture and beyond
- Additive Combinatorics
- Some new inequalities in additive combinatorics
- Inverse questions for the large sieve
- A proof of a conjecture of Lev
- The number of k-sumsets in an abelian group
- On the directions determined by Cartesian products and the clique number of generalized Paley graphs
- Additive correlation and the inverse problem for the large sieve
- Maximality of subfields as cliques in Cayley graphs over finite fields
- A note on pseudorandom Ramsey graphs
- On Cayley sum signed graphs-I
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
- Colouring versus density in integers and Hales-Jewett cubes
- Distribution of power residues over shifted subfields and maximal cliques in generalized Paley graphs
- Exact values and improved bounds on the clique number of cyclotomic graphs
- Difference sets in \(\mathbb{R}^d\)
- Uniform sets with few progressions via colourings
- On Lev's periodicity conjecture
- Sharp Szemerédi-Trotter constructions in the plane
- Testing sumsets is hard
- Sets of integers with no large sum-free subset
- Special sequences as subcodes of Reed-Solomon codes
- Large sets in finite fields are sumsets
This page was built for publication: Open problems in additive combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431589)
