Sum-free sets in abelian groups

From MaRDI portal
Revision as of 18:44, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2382245

DOI10.1007/BF02785363zbMath1158.11311arXivmath/0307142OpenAlexW2049319277WikidataQ105942409 ScholiaQ105942409MaRDI QIDQ2382245

Imre Z. Ruzsa

Publication date: 28 September 2007

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0307142




Related Items (58)

Product of three primes in large arithmetic progressionsOn the number of sum-free triplets of setsOn the structure of large sum-free sets of integersThe number of sumsets in abelian groupConstructing patterns of (many) ESSs under support size controlThree questions of Bertram on locally maximal sum-free setsOn maximal sum-free sets in abelian groupsCounting sumsets and differences in an abelian groupMaximum number of sum-free colorings in finite abelian groupsDioid partitions of groupsGroups containing small locally maximal product-free setsOn additive co-minimal pairsOn the maximum number of integer colourings with forbidden monochromatic sumsQUASI-RANDOM PROFINITE GROUPSThe structure of popular difference setsOn extending Pollard's theorem for \(t\)-representable sumsOn the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomialsInteger colorings with forbidden rainbow sumsEstimates of the number of \((k,l)\)-sumsets in the finite abelian groupA note on the largest sum‐free sets of integersLarge sum-free sets in \(\mathbb{Z}_5^n\)An inequality for the compositions of convex functions with convolutions and an alternative proof of the Brunn-Minkowski-Kemperman inequalityThe number of additive triples in subsets of abelian groupsOn a common-extendable, non-Sidorenko linear systemThe Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian GroupsUnnamed ItemA characterization of elementary abelian 2-groupsTHE MAXIMUM SIZE OF -SUM-FREE SETS IN CYCLIC GROUPSEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsOn the complexity of families of pseudo-random subsetsMinimum number of additive tuples in groups of prime orderA density version of Waring’s problemLarge sum-free sets in \(\mathbb Z/p\mathbb Z\)On the complexity of finding and counting solution-free sets of integersStability results for random discrete structuresOn sum-free subsets of the torus groupAsymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime orderAsymptotics of the number of sum-free sets in groups of prime orderGroups with few maximal sum-free setsProduct-free sets in the free semigroupCounting sum-free sets in abelian groupsRandom sum-free subsets of abelian groupsSymmetric complete sum-free sets in cyclic groupsOn filled soluble groupsAsymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groupsSum-free subsets of finite abelian groups of type IIISets of integers with no large sum-free subsetThe Number of k-Sumsets in an Abelian GroupAsymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of NaturalsThe largest $(k, \ell)$-sum-free sets in compact abelian groupsNear equality in the Riesz-Sobolev inequalityON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUPNumber of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphsAN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREMLarge sum-free sets in ternary spacesGrowth in groups: ideas and perspectivesCounting independent sets in graphsOn those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets




Cites Work




This page was built for publication: Sum-free sets in abelian groups