Computing Irreducible Representations of Supersolvable Groups
Copyright policy )Computing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time O ( n 2 log n ) O({n^2}\log n) . We present an improved algorithm with running time O ( n log n ) O(n\log n) .
Ordinary representations and characters, running time, Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks, irreducible representations, Symbolic computation and algebraic computation, supersolvable groups, algorithms, power-commutator presentations, Computational methods (representations of groups)
Ordinary representations and characters, running time, Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks, irreducible representations, Symbolic computation and algebraic computation, supersolvable groups, algorithms, power-commutator presentations, Computational methods (representations of groups)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!