Counting sumsets and sum-free sets modulo a prime
Studia Scientiarum Mathematicarum Hungarica · 2004
DOI: 10.1556/012.2004.41.3.2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, 2004. Verfasst von B. Green und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).
Abstract (Originalsprache)
Let p be a prime. A set A of residues modulo p is said to be sum-free if there are no solutions to a = a ′ + a ″ with a, a ′, a ″ ∈ A . We show that there are 2 p /3+ o ( p ) such sets. We also count the number of distinct sets of the form B + B , where B is a set of residues modulo p . Once again, there are 2 p /3+ o ( p ) such sets.
Zitieren
APA
Green, B., & Ruzsa, I. Z. (2004). Counting sumsets and sum-free sets modulo a prime. Studia Scientiarum Mathematicarum Hungarica. https://doi.org/10.1556/012.2004.41.3.2
Vancouver
Green B, Ruzsa IZ. Counting sumsets and sum-free sets modulo a prime. Studia Scientiarum Mathematicarum Hungarica. 2004. doi:10.1556/012.2004.41.3.2
BibTeX
@article{Green2004,
author = {Green, B. and Ruzsa, I. Z.},
title = {Counting sumsets and sum-free sets modulo a prime},
journal = {Studia Scientiarum Mathematicarum Hungarica},
year = {2004},
doi = {10.1556/012.2004.41.3.2}
}
EUVIMED