Counting (k,l)-sumsets in groups of prime order

V. Sargsyan

Counting (k,l)-sumsets in groups of prime order

Discrete Mathematics 2012-07-27 v1 Number Theory

Authors: V. Sargsyan

Abstract

A subset $A$ of a group $G$ is called $(k, l)$ -{\it sumset}, if $A= kB-lB$ for some $B\subseteq G$ , where $kB-lB={x_1+...+x_k-x_{k+1}-...-x_{k+l} : x_1,..., x_{k+l}\in B}.$ Upper and lower bounds for the number $(k, l)$ -sumsets in groups of prime order are provided.

Keywords

sumsets groups of prime order additive combinatorics counting problems subset sums

Cite

@article{arxiv.1207.6374,
  title  = {Counting (k,l)-sumsets in groups of prime order},
  author = {V. Sargsyan},
  journal= {arXiv preprint arXiv:1207.6374},
  year   = {2012}
}

Counting (k,l)-sumsets in groups of prime order

Abstract

Keywords

Cite

Related papers