Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-26T01:23:47.808Z 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 x1, …, Xn and let G be an arbitrary group. An element ωF determines a function xω(x) from n-tuples x = (x1, x2, …, xn) ∈ Gn into G. In a recent paper [5] Solomon showed that if ω1, ω2, …, ωmF with m < n, and K1, …, Km are conjugacy classes of a finite group G, then the number of xGn 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.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970

References

1. Brauer, R., On a theorem of Frobenius, Amer. Math. Monthly 76 (1969), 1215.Google Scholar
2. Coxeter, H. S. M. and Moser, W. O., Generators and relations for discrete groups, Second Ed. (Springer-Verlag, New York, 1965).Google Scholar
3. Curtis, C. W. and Reiner, I., Representation theory of finite groups and associative algebras (Interscience, New York, 1962).Google Scholar
4. Magnus, W., Karrass, A., and Solitar, D., Combinational group theory (Interscience, New York, 1966).Google Scholar
5. Solomon, L., The solution of equations in groups, Arch. Math. 20 (1969), 241247.Google Scholar