The number of additive triples in subsets of abelian groups
From MaRDI portal
Publication:5360385
Abstract: A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements with . The study of how large the largest sum-free subset of a given abelian group is had started more than thirty years before it was finally resolved by Green and Ruzsa a decade ago. We address the following more general question. Suppose that a set of elements of an abelian group has cardinality . How many Schur triples must contain? Moreover, which sets of elements of have the smallest number of Schur triples? In this paper, we answer these questions for various groups and ranges of .
Recommendations
- Sums of triples in Abelian groups
- The number of sumsets in abelian group
- The number of \(k\)-sumsets in an abelian group
- The number of sum-free sets in abelian groups
- Subset sums in abelian groups
- On the number of subgroups of finite abelian groups
- On the number of subgroups of finite abelian groups
- scientific article; zbMATH DE number 1059208
- The multisubset sum problem for finite abelian groups
Cites work
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3445509 (Why is no real title available?)
- scientific article; zbMATH DE number 3232871 (Why is no real title available?)
- scientific article; zbMATH DE number 3256524 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- A Generalisation of the Theorem of Cauchy and Davenport
- Abschätzung der asymptotischen Dichte von Summenmengen
- Binary set functions and parity check matrices
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- Equality in Pollard's theorem on set addition of congruence classes
- Explicit construction of linear sized tolerant networks
- Extremal problems among subsets of a set
- Maximal sum-free sets in finite abelian groups
- Maximal sum-free sets in finite abelian groups, V
- Maximal sum-free sets of elements of finite groups
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- On a theorem of Rademacher-Turán
- On small sumsets in an abelian group
- On the Minimal Density of Triangles in Graphs
- On the Ramsey multiplicity of complete graphs
- On the number of complete subgraphs and circuits contained in graphs
- On the number of monotone sequences
- Sets of integers with no large sum-free subset
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- Sum-free sets in Abelian groups.
- Sum-free sets in abelian groups
- Sum-free sets in vector spaces over \(GF(2)\)
- Supersaturated graphs and hypergraphs
- Supersaturation in the Boolean lattice
- The minimum number of disjoint pairs in set systems and related problems
- The minimum number of monotone subsequences
- The number of cliques in graphs of given order and size
Cited in
(7)- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
- The maximum size of \((k,l)\)-sum-free sets in cyclic groups
- Structure and supersaturation for intersecting families
- On tripling constant of multiplicative subgroups
- The Schur degree of additive sets
- Supersaturation in posets and applications involving the container method
- Minimum number of additive tuples in groups of prime order
This page was built for publication: The number of additive triples in subsets of abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360385)