Counting (k,l)-sumsets in groups of prime order
Abstract
A subset A of a group G is called (k, l)- sumset, if A= kB-lB for some B⊂eq G, where kB-lB=x1+...+xk-xk+1-...-xk+l : x1,..., xk+l∈ B. Upper and lower bounds for the number (k, l)-sumsets in groups of prime order are provided.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.