论文信息 - An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra - 字舞流文

An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra

We present an algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. This algorithm has been implemented for System GAP, version 4.

Ángel del Río | Aurora Olivieri

[1] Manuel Ruiz,et al. COMPUTING LARGE DIRECT PRODUCTS OF FREE GROUPS IN INTEGRAL GROUP RINGS , 2002 .

[2] S. Sehgal,et al. Large Groups of Units of Integral Group Rings of Finite Nilpotent Groups , 1993 .

[3] James William Pendergrass. The Schur subgroup of the Brauer group. , 1977 .

[4] Ángel del Río,et al. A structure theorem for the unit group of the integral group ring of some finite groups , 2000 .

[5] R. James Milgram,et al. The Schur Subgroup of the Brauer Group , 1994 .

[6] Eric Jespers,et al. CENTRAL IDEMPOTENTS IN THE RATIONAL GROUP ALGEBRA OF A FINITE NILPOTENT GROUP , 2003 .

[7] Jürgen Ritter,et al. Construction of units in integral group rings of finite nilpotent groups , 1991 .

[8] Allen Herman. On the automorphism groups of rational group algebras of metacyclic groups , 1997 .

[9] S. B. Conlon. Calculating Characters of p-Groups , 1990, J. Symb. Comput..

[10] Eric Jespers,et al. Generators of large subgroups of the unit group of integral group rings , 1993 .

[11] Juan Jacobo Simón,et al. On Monomial Characters and Central Idempotents of Rational Group Algebras , 2004 .

[12] Michael Clausen,et al. Computing irreducible representations of supersolvable groups , 1994 .

[13] Donald Passman,et al. Infinite Crossed Products , 1989 .