pith. sign in

arxiv: 1409.7632 · v2 · pith:FTTE4L6Onew · submitted 2014-09-26 · 🧮 math.RT · math.GR· math.RA

On the Burnside-Brauer-Steinberg theorem

classification 🧮 math.RT math.GRmath.RA
keywords representationbrauerburnsidecharacteristicfaithfulfinitegroupirreducible
0
0 comments X
read the original abstract

A well-known theorem of Burnside says that if $\rho$ is a faithful representation of a finite group $G$ over a field of characteristic $0$, then every irreducible representation of $G$ appears as a constituent of a tensor power of $\rho$. In 1962, R. Steinberg gave a module theoretic proof that simultaneously removed the constraint on the characteristic, and allowed the group to be replaced by a monoid. Brauer subsequently simplified Burnside's proof and, moreover, showed that if the character of $\rho$ takes on $r$ distinct values, then the first $r$ tensor powers of $\rho$ already contain amongst them all of the irreducible representations of $G$ as constituents. In this note we prove the analogue of Brauer's result for finite monoids. We also prove the corresponding result for the symmetric powers of a faithful representation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry

    cs.LG 2025-12 unverdicted novelty 8.0

    Approximate symmetry can be enforced with logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.