1
vote
2answers
60 views

Given a Cayley table, is there an algorithm to determine if it is a dihedral group?

Showing that it is a group is simple enough, but is it possible to determine if it is a dihedral group or not just by looking at the Cayley table?
10
votes
1answer
251 views

How many Groups there are on a finite set?

Let say cardinality of set S is $n=|S|$. We know that there are $n^{n^2}$ all binary operations on that set. To find out how many groups can be created by this set and by those operations, we need not ...
16
votes
1answer
376 views

Books to understand the construction of all groups of a specific order

The algorithms introduced by Besche–Eick (1999) were used to construct (or count) the groups of order up to 2000 in Besche–Eick–O'Brien (2002), yet I find the algorithms somewhat inaccessible. How ...
2
votes
1answer
78 views

Details about “fingerprinting” algorithms for groups?

where can I find details about "Fingerprinting" algorithms (to test whether two groups are non-isomorphic) "‘Fingerprinting’: For every group $G_1,…, G_r$ evaluate various isomorphism-invariant ...
1
vote
0answers
72 views

Efficiency of Group-Theoretic Algorithms in MAGMA

Given a finite permutation group $G$ and an element $a\in G$ with conjugacy class $X$, I am interested in determining when for a given element $x\in X$ the subgroup $<a,x>$ generated by $a$ and ...
6
votes
1answer
445 views

Algorithm to find conjugacy classes of subgroups/elements (in matrix groups)?

I'm looking for a simple (=doable to implement by myself) algorithm to compute the conjugacy classes of elements and subgroups of a given subgroup of $\text{P}{\Gamma}\text{L}(n,q)$. So given a group ...
2
votes
1answer
190 views

Converting a (signed) permutation to a reduced word

I vaguely know that by looking at the inversions of a permutation, you can write down the reduced word expressing the permutation as a product of adjacent transpositions $s_i = (i,i+1)$. However, I ...
17
votes
4answers
3k views

How does one compute the sign of a permutation?

The sign of a permutation $\sigma\in \mathfrak{S}_n$, written ${\rm sgn}(\sigma)$, is defined to be +1 if the permutation is even and -1 if it is odd, and is given by the formula $${\rm sgn}(\sigma) ...
2
votes
3answers
128 views

Finding a (small) prime great enough that there are at least m elements of order m

I'm hoping that someone can provide me with some results or point me in the right direction. I'm working with finite fields; really, I'm just doing arithmetic modulo a prime $p$. I'm taking elements ...