A combinatorial problem in finite fields, i

Gerald Myerson*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Given a subgroup G of the multiplicative group of a finite field, we investigate the number of representations of an arbitrary field element as a sum of elements, one from each coset of G. When G is of small index, the theory of cyclotomy yields exact results. For all other G, we obtain good estimates. This paper formed a portion of the author's doctoral dissertation.

Original languageEnglish
Pages (from-to)179-187
Number of pages9
JournalPacific Journal of Mathematics
Issue number1
Publication statusPublished - 1979
Externally publishedYes


Dive into the research topics of 'A combinatorial problem in finite fields, i'. Together they form a unique fingerprint.

Cite this