The number of sumsets in Abelian group
-
Aleksandr A. Sapozhenko
and
Vahe G. Sargsyan
Abstract
Asymptotic upper and lower bounds for the numbers of distinct subsets A + B in Abelian group of order n are derived, where |A|, |B| ≥ n(log n)−1/8.
Originally published in Diskretnaya Matematika (2018) 30, №4, 96–105 (in Russian).
Funding source: Russian Foundation for Basic Research
Award Identifier / Grant number: 16-01-00593A
Funding statement: This work was supported by the Russian Foundation for Basic Research, project №16-01-00593A
References
[1] Green B., Ruzsa I., “Counting sumsets and sum-free sets modulo a prime”, Studia Sci. Math. Hungarica., 41 (2004), 285–293.10.1556/012.2004.41.3.2Search in Google Scholar
[2] Sargsyan V. G., “The number of differences in groups of prime order”, Discrete Math. Appl., 23:2 (2013), 195–201.10.1515/dma-2013-013Search in Google Scholar
[3] Sargsyan V. G., “Counting sumsets and differences in an Abelian group”, J. Appl. Indust. Math., 9:2, 275–282.10.1134/S1990478915020131Search in Google Scholar
[4] Alon N., Granville A., Ubis A., “The number of sumsets in a finite field”, Bull. London Math. Soc., 42:5 (2010), 784–794.10.1112/blms/bdq033Search in Google Scholar
[5] Green B., Ruzsa I., “Sum-free sets in Abelian groups”, Israel J. Math., 147 (2005), 157–188.10.1007/BF02785363Search in Google Scholar
© 2020 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Attribute-efficient learning of Boolean functions from Post closed classes
- Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs
- Post theorem for strongly dependent n-ary semigroups
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- On the number of ones in outcome sequence of extended Pohl generator
- The number of sumsets in Abelian group
- Generalized allocation scheme with cell occupancies from a fixed finite set
- Universal functions for linear functions depending on two variables
Articles in the same Issue
- Attribute-efficient learning of Boolean functions from Post closed classes
- Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs
- Post theorem for strongly dependent n-ary semigroups
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- On the number of ones in outcome sequence of extended Pohl generator
- The number of sumsets in Abelian group
- Generalized allocation scheme with cell occupancies from a fixed finite set
- Universal functions for linear functions depending on two variables
