Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



The Chevalley-Warning theorem
and a combinatorial question on finite groups

Author: B. Sury
Journal: Proc. Amer. Math. Soc. 127 (1999), 951-953
MSC (1991): Primary 20D60, 05E15, 11T06
MathSciNet review: 1476394
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Recently, W. D. Gao (1996) proved the following theorem: For a cyclic group $G$ of prime order, and any element $a$ in it, and an arbitrary sequence $g_1, \ldots, g_{2p-1}$ of $2p-1$ elements from $G$, the number of ways of writing $a$ as a sum of exactly $p$ of the $g_i$'s is $1$ or $0$ modulo $p$ according as $a$ is zero or not. The dual purpose of this note is (i) to give an entirely different type of proof of this theorem; and (ii) to solve a conjecture of J. E. Olson (1976) by answering an analogous question affirmatively for solvable groups.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (1991): 20D60, 05E15, 11T06

Retrieve articles in all journals with MSC (1991): 20D60, 05E15, 11T06

Additional Information

B. Sury
Affiliation: School Of Mathematics Tata Institute of Fundamental Research Homi Bhabha Road, Bombay 400 005 India

Keywords: Chevalley-Warning theorem, combinatorial group theory
Received by editor(s): July 9, 1997
Communicated by: David E. Rohrlich
Article copyright: © Copyright 1999 American Mathematical Society