Estimates of the number of (k, l)-sumsets in the finite Abelian group
-
Vahe G. Sargsyan
Abstract
The subset A of the group G is called (k, l)-sumset if there exists subset B ⊆ G such that A = kB-lB, where kB - lB = {x1 + ... + xk - xk+1 ... - xk+l | x1,..., xk+l ∈ B}. Upper and lower bounds of the number of (k, l)-sumsets in the Abelian group are obtained.
Originally published in Diskretnaya Matematika (2016) 28, №,71-80 (in Russian).
Funding source: Russian Foundation for Basic Research
Award Identifier / Grant number: 13-01-00958a
Funding statement: This work was supported by the Russian Science Foundation (project no. 13-01-00958a).
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 (k, l)-sumsets in groups of a prime order”, Acta Univ. Sapientiae, Informatica, 4:1 (2012), 33-47.10.1515/dma-2012-026Search in Google Scholar
4 Sargsyan V. G., “Counting sumsets and differences in an abelian group”, J. Appl. Indust. Math., 9:2 (2015), 275-282.10.1134/S1990478915020131Search in Google Scholar
5 Nathanson, M. B., Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Berlin, Heidelberg, New York: Springer-Verlag, 1996, 296 pp.Search in Google Scholar
6 Green, B., Ruzsa, I., “Sum-free sets in abelian groups”, Israel J. Math., 147 (2005), 157-188.10.1007/BF02785363Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Estimates of the number of (k, l)-sumsets in the finite Abelian group
- Independence numbers of random sparse hypergraphs
- Steganographic capacity for one-dimensional Markov cover
Articles in the same Issue
- Frontmatter
- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Estimates of the number of (k, l)-sumsets in the finite Abelian group
- Independence numbers of random sparse hypergraphs
- Steganographic capacity for one-dimensional Markov cover
