Article
Licensed
Unlicensed
Requires Authentication
The number of differences in groups of prime order
-
V. G. Sargsyan
Published/Copyright:
December 5, 2013
Abstract
- A subset A of a group G is called a difference if there exists a subset B ⊆ G such that A = B − B, where
B − B = {x − y | x, y ∈ B}.
The asymptotic behavior of the logarithm of the number of differences in groups of prime order is studied.
This work was supported by the Russian Foundation for Basic Research, grant 13-01- 00958a.
References
Published Online: 2013-12-05
Published in Print: 2013-12
© 2013 by Walter de Gruyter GmbH & Co.
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- On the solvability of the equational theory of commutative medial n-ary groupoids
- Estimating the stability radius of the vector MAX-CUT problem
- Statistical estimation of parameters for binary Markov chain models with embeddings
- A simplified proof of a lower complexity estimate
- Finite groups with nilpotent and Hall subgroups
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- The number of differences in groups of prime order
- Characteristic submodules of injective modules
- On transformations of probability distributions by read-once quasigroup formulae
Articles in the same Issue
- Masthead
- On the solvability of the equational theory of commutative medial n-ary groupoids
- Estimating the stability radius of the vector MAX-CUT problem
- Statistical estimation of parameters for binary Markov chain models with embeddings
- A simplified proof of a lower complexity estimate
- Finite groups with nilpotent and Hall subgroups
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- The number of differences in groups of prime order
- Characteristic submodules of injective modules
- On transformations of probability distributions by read-once quasigroup formulae