Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T22:31:20.629Z Has data issue: false hasContentIssue false

Systems of equations and generalized characters in groups

Published online by Cambridge University Press:  20 November 2018

I. M. Isaacs*
Affiliation:
University of Wisconsin, Madison, Wisconsin
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let F be the free group on n generators x 1, …, Xn and let G be an arbitrary group. An element ω ∈ F determines a function x → ω(x) from n-tuples x = (x 1, x 2, …, xn ) ∈ Gn into G. In a recent paper [5] Solomon showed that if ω 1, ω 2, …, ωm ∈ F with m < n, and K 1, …, Km are conjugacy classes of a finite group G, then the number of x ∈ Gn with ωi(x) ∈ Ki for each i, is divisible by |G|. Solomon proved this by constructing a suitable equivalence relation on Gn .

Another recent application of an unusual equivalence relation in group theory is in Brauer's paper [1], where he gives an elementary proof of the Frobenius theorem on solutions of xk = 1 in a group.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970