Article
Licensed
Unlicensed
Requires Authentication
Asymptotics of the logarithm of the number of (k, l)-sum-free sets in an Abelian group
-
Vage G. Sargsyan
Published/Copyright:
April 17, 2015
Abstract
Asubset A of elements of a group G is (k, l)-sum-free if A does not contains solutions of the equation x1 + . . . + xk = y1 + . . . + yl. We have obtained asymptotics of the logarithm of the number of (k, l)-sum-free sets in an Abelian group.
Published Online: 2015-4-17
Published in Print: 2015-4-1
© 2015 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- Weighing algorithms of classification and identification of situations
- Arithmetic complexity of the Stirling transforms
- Asymptotics of the logarithm of the number of (k, l)-sum-free sets in an Abelian group
- Multiplicative complexity of some Boolean functions
- On a statistic for testing the homogeneity of polynomial samples
Articles in the same Issue
- Frontmatter
- Weighing algorithms of classification and identification of situations
- Arithmetic complexity of the Stirling transforms
- Asymptotics of the logarithm of the number of (k, l)-sum-free sets in an Abelian group
- Multiplicative complexity of some Boolean functions
- On a statistic for testing the homogeneity of polynomial samples
