On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (Q3887632): Difference between revisions

@@ label / en / label / en @@
+On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2006206
@@ Property / full work available at URL: https://doi.org/10.2307/2006206 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3216859064
@@ Property / OpenAlex ID: W3216859064 / rank @@
+Normal rank
@@ Property / title @@
+On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (English)
+Normal rank
@@ Property / cites work @@
+Implementation and Analysis of the Todd-Coxeter Algorithm
+Normal rank
@@ Property / cites work @@
+Defining relations for the Held-Higman-Thompson simple group
+Normal rank
@@ Property / cites work @@
+The multipliers of the simple groups of order 604,800 and 50, 232,960
+Normal rank
@@ Property / cites work @@
+Q3895641
@@ Property / cites work: Q3895641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190797
@@ Property / cites work: Q4190797 / rank @@
+Normal rank
@@ Property / cites work @@
+ABSTRACT DEFINITIONS FOR THE MATHIEU GROUPS
@@ Property / cites work: ABSTRACT DEFINITIONS FOR THE MATHIEU GROUPS / rank @@
+Normal rank
@@ Property / cites work @@
+A practical method for enumerating cosets of a finite abstract group
+Normal rank