Large sets in finite fields are sumsets

DOI10.1016/J.JNT.2006.11.007zbMATH Open1145.11085OpenAlexW1966617300MaRDI QIDQ996275FDOQ996275

Authors Noga Alon

Publication date 14 September 2007

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jnt.2006.11.007

zbMATH Keywords

probabilistic methodcharacter sumssumsetCayley sum graphgraph eigenvalues

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Recommendations

• Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
• Counting sumsets and sum-free sets modulo a prime
• Maximal sum-free sets in finite abelian groups
• The sum-product estimate for large subsets of prime fields
• The number of sumsets in a finite field

Cites work

• scientific article; zbMATH DE number 3349875 (Why is no real title available?)
• Counting sets with small sumset, and the clique number of random Cayley graphs
• Open problems in additive combinatorics
• Random regular graphs of high degree
• Repeated communication and Ramsey graphs
• Sharp bounds for some multicolour Ramsey numbers
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(39)

• The Connectivity of addition Cayley graphs
• Unitary addition Cayley signed graphs
• On integral Cayley sum graphs
• Covering sumsets of a prime field and class numbers
• Cayley sum color and anti-circulant graphs
• Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
• Regular Turán numbers of complete bipartite graphs
• Unitary Addition Cayley Ring Signed Graphs *
• On the number of popular differences
• A new bound for \(A(A + A)\) for large sets
• The chromatic number of random Cayley graphs
• On the independence number of sparser random Cayley graphs
• Subgroup perfect codes in Cayley sum graphs
• Additive properties for sets of polynomial values
• On Cayley sum graphs of non-abelian groups
• The number of sumsets in a finite field
• Power monoids: a bridge between factorization theory and arithmetic combinatorics
• Combinatorics. Abstracts from the workshop held January 5--11, 2014.
• On the reducibility of large sets of residues modulo \(p\)
• Connectivity of addition Cayley graphs
• Large spectral gaps and small sumsets
• Sums and products along sparse graphs
• Chowla's cosine problem
• Additive patterns in multiplicative subgroups
• Perfect codes in Cayley sum graphs
• Sum-free sets which are closed under multiplicative inverses
• The number of \(k\)-sumsets in an abelian group
• The Representation of Some Integers as a Subset Sum
• On Cayley sum signed graphs-I
• Cayley sum graphs and their applications to codebooks
• On the subgraphs of Cayley sum graphs
• Inverse problems for minimal complements and maximal supplements
• Set systems with distinct sumsets
• Sums and products with smooth numbers
• Integral Cayley sum graphs and groups
• Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
• Sidon set systems
• Eigenvalues of Cayley graphs
• On a problem of Konyagin

This page was built for publication: Large sets in finite fields are sumsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996275)