The number of additive triples in subsets of abelian groups
From MaRDI portal
Publication:5360385
DOI10.1017/S0305004115000821zbMath1371.11030arXiv1507.03764MaRDI QIDQ5360385
Wojciech Samotij, Benjamin Sudakov
Publication date: 28 September 2017
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03764
Other combinatorial number theory (11B75) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems of additive number theory, including sumsets (11P70) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (5)
Supersaturation in posets and applications involving the container method ⋮ Structure and supersaturation for intersecting families ⋮ THE MAXIMUM SIZE OF -SUM-FREE SETS IN CYCLIC GROUPS ⋮ Minimum number of additive tuples in groups of prime order ⋮ The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Ramsey multiplicity of complete graphs
- On the number of monotone sequences
- The minimum number of disjoint pairs in set systems and related problems
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- Sets of integers with no large sum-free subset
- On a theorem of Rademacher-Turán
- Supersaturated graphs and hypergraphs
- Binary set functions and parity check matrices
- Explicit construction of linear sized tolerant networks
- On small sumsets in an abelian group
- Sum-free sets in vector spaces over \(GF(2)\)
- Extremal problems among subsets of a set
- The minimum number of monotone subsequences
- Sum-free sets in abelian groups
- Abschätzung der asymptotischen Dichte von Summenmengen
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- The number of cliques in graphs of given order and size
- Equality in Pollard's theorem on set addition of congruence classes
- On the Minimal Density of Triangles in Graphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Maximal sum-free sets in finite abelian groups, V
- A Generalisation of the Theorem of Cauchy and Davenport
- Supersaturation in the Boolean lattice
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- On the number of complete subgraphs and circuits contained in graphs
- Maximal sum-free sets of elements of finite groups
- Maximal sum-free sets in finite abelian groups
- Sum-free sets in Abelian groups.
This page was built for publication: The number of additive triples in subsets of abelian groups