Result 1 to 20 of 26 total
On semiregular permutations of a finite set. (English)
Math. Comput. 81, No. 277, 605-622 (2012).
1
On semiregular permutations of a finite set (English)
Math. Comput. 81, No. 277 (2012).
2
On proportions of pre-involutions in finite classical groups. (English)
J. Algebra 324, No. 5, 1016-1043 (2010).
3
Apportionment methods (English)
Mathematical Social Sciences 56, No. 2, 240-253 (2008).
4
On the proportion of permutations of order a multiple of the degree. (English)
J. Lond. Math. Soc., II. Ser. 76, No. 3, 622-632 (2007).
5
On permutations of order dividing a given integer. (English)
J. Algebr. Comb. 26, No. 1, 125-142 (2007).
6
The minimum length of a base for the symmetric group acting on partitions (English)
Eur. J. Comb. 28, No. 6, 1575-1581 (2007).
7
A reduction algorithm for large-base primitive permutation groups. (English)
LMS J. Comput. Math. 9, 159-173, electronic only (2006).
8
A reduction algorithm for matrix groups with an extraspecial normal subgroup. (English)
Hulpke, A. (ed.) et al., Finite geometries, groups, and computation. Proceedings of the conference, Pingree Park, CO, USA, September 4‒9, 2004. Berlin: Walter de Gruyter (ISBN 3-11-018220-3/hbk). 1-16 (2006).
9
On the lengths of pairs of complex matrices of size at most five. (English)
Bull. Aust. Math. Soc. 73, No. 3, 461-472 (2006).
10
Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (English)
J. Algebra 292, No. 1, 4-46 (2005).
11
Constructive recognition of normalizers of small extra-special matrix groups. (English)
Int. J. Algebra Comput. 15, No. 2, 367-394 (2005).
12
A black-box group algorithm for recognizing finite symmetric and alternating groups. I. (English)
Trans. Am. Math. Soc. 355, No.5, 2097-2113 (2003).
13
Permutations with restricted cycle structure and an algorithmic application. (English)
Comb. Probab. Comput. 11, No.5, 447-464 (2002).
14
Permutations with restricted cycle structure and an algorithmic application (English)
Combinatorics, Probability & Computing 11, No. 5, 447-464 (2002).
15
Complexity and computation in matrix groups. (English)
Downey, Rod (ed.) et al., Aspects of complexity. Minicourses in algorithmics, complexity and computational algebra. Mathematics workshop, Kaikoura, New Zealand, January 7‒15, 2000. Berlin: de Gruyter (ISBN 3-11-016810-3). de Gruyter Ser. Log. Appl. 4, 87-113 (2001).
16
Computing in groups with exponent six. (English)
Atkinson, Michael (ed.) et al., Computational and geometric aspects of modern algebra. Proceedings of the workshop, Edinburgh, UK, July 23-31, 1998. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 275, 87-100 (2000).
17
A recognition algorithm for non-generic classical groups over finite fields. (English)
J. Aust. Math. Soc., Ser. A 67, No.2, 223-253 (1999).
18
Descriptions of groups of prime-power order. (English)
J. Symb. Comput. 25, No.5, 665-682 (1998).
19
A recognition algorithm for classical groups over finite fields. (English)
Proc. Lond. Math. Soc., III. Ser. 77, No. 1, 117-169 (1998).
20
Result 1 to 20 of 26 total
Start
Contact
Print
General Help
