Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Unger, William R."'
Autor:
Unger, William R.
We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.
Comment:
Comment:
Externí odkaz:
http://arxiv.org/abs/1905.09431
Autor:
Unger, William R.
We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.
Comm
Comm
Externí odkaz:
http://arxiv.org/abs/1905.08936
Autor:
Unger, William R.
Publikováno v:
J. Symbolic Comput. 93 (2019), 148-160
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and examples o
Externí odkaz:
http://arxiv.org/abs/1712.00907
Publikováno v:
In Journal of Algebra 1 March 2020 545:64-87
Publikováno v:
In Journal of Symbolic Computation November-December 2019 95:26-38
Publikováno v:
In Journal of Symbolic Computation 2003 35(4):421-439
Autor:
Cohen, Arjeh M. Cohen Henri, Sturmfels, David Eisenbud Bernd, Bosma, Wieb, Cannon, John, Roney-Dougal, Colva M., Unger, William R.
Publikováno v:
Discovering Mathematics with Magma; 2006, p243-260, 18p
Publikováno v:
In Journal of Clinical Epidemiology 1994 47(10):1099-1108