Pith. sign in

REVIEW 2 cited by

On the Burnside-Brauer-Steinberg theorem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1409.7632 v2 pith:FTTE4L6O submitted 2014-09-26 math.RT math.GRmath.RA

classification math.RTmath.GRmath.RA
keywords representationbrauerburnsidecharacteristicfaithfulfinitegroupirreducible
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry

    cs.LG 2025-12 unverdicted novelty 8.0 of 10

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

  2. Adaptive Symmetry Discovery for Dynamical System Identification

    cs.LG 2026-08 reject novelty 7.0 of 10

    For feature-lifted dynamical systems with unknown finite-group symmetry, the paper proves a representation-theoretic characterization of the minimal identification trajectory length and gives a random-generator algori...

Pith tools