论文信息 - Computing Double Cosets in Soluble Groups - 字舞流文

Computing Double Cosets in Soluble Groups

We discuss the use of orbit-stabilizer and orbit reduction techniques for computing representatives of double cosets in finite soluble groups given by a polycyclic presentation.

Michael C. Slattery | M. C. Slattery

[1] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[2] Michael C. Slattery,et al. Computing Character Degrees in p-Groups , 1986, J. Symb. Comput..

[3] S. B. Conlon. Computing Modular and Projective Character Degrees of Soluble Groups , 1990, J. Symb. Comput..

[4] J. Neubüser,et al. Some remarks on the computation of conjugacy classes of soluble groups , 1989, Bulletin of the Australian Mathematical Society.

[5] Alice C. Niemeyer. A Finite Soluble Quotient Algorithm , 1994, J. Symb. Comput..

[6] C. Wright,et al. Some remarks on the computation of complements and normalizers in soluble groups , 1990 .

[7] Steve Linton. Double Coset Enumeration , 1991, J. Symb. Comput..

[8] Stephen P. Glasby,et al. Computing Intersections and Normalizers in Soluble Groups , 1990, J. Symb. Comput..

[9] P. Hall. On Representatives of Subsets , 1935 .

[10] Mike F. Newman,et al. Calculating presentations for certain kinds of quotient groups , 1976, SYMSAC '76.

[11] Extraspecial towers and Weil representations , 1992, 1405.7228.

[12] Greg Butler,et al. On Holt's Algorithm , 1993, J. Symb. Comput..

[13] ENUMERATION OF DOUBLE COSETS , 1982 .