Vol. 82, No. 1, 1979

Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
A combinatorial problem in finite fields. I

Gerald Ira Myerson

Vol. 82 (1979), No. 1, 179–187
Abstract

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.

Mathematical Subject Classification 2000
Primary: 05A15
Secondary: 12C20
Milestones
Received: 1 April 1978
Published: 1 May 1979
Authors
Gerald Ira Myerson