4
votes
0answers
104 views

Does this class of groups contain finitely generated infinite periodic groups?

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
8
votes
3answers
391 views

For which series of finite simple groups is it algorithmically decidable whether they contain a homomorphic image of a given finitely presented group?

Let $G$ be a group given by a finite presentation. On the one hand, it is easy to determine the abelian invariants of $G$, or in other words, it is algorithmically decidable whether $G$ surjects to a ...
1
vote
0answers
47 views

Some resources about minimum-length generator sequences

In the group theory I want to know what are the best results known for problem of finding minimum-length generator sequences. This problam have different titles in articles that cause difficality in ...
6
votes
1answer
307 views

Using math software to show that the following groups are infinite?

I would like to show that the following finitely presented group in 3 generators $P, Q, R$ is infinite in certain cases: $$P^p, Q^q, R^r, (PQ)^2, (QR)^2, (PQR)^2, (QR^{r/2+1})^a (RQR^{r/2})^b$$ For ...
5
votes
1answer
165 views

How hard is it to compute the diameter and the growth function of a finite permutation group of small degree?

Let $G \leq {\rm S}_n$ be a finite permutation group, and let $S = \{g_1, \dots, g_k\}$ be a generating set for $G$ which is closed under inversion and which does not contain the identity. The growth ...
1
vote
0answers
98 views

Generator size for cyclic groups

Let $p$ be prime. Consider $\Bbb Z_{p}$, the cyclic multiplicative group. Is it possible to choose a generator $c$ as small as $O(\log(p))$? (wiki shows $c$ as small as $O(\log^{6}(p))$ is possible ...
5
votes
0answers
342 views

Example of a group with unsolvable word problem

Today I noticed that the last relator in the 27-relator presentation of a group with unsolvable word problem given in Donald J. Collins: A simple presentation of a group with unsolvable word ...
11
votes
0answers
396 views

Possible orders of products of 2 involutions which interchange disjoint residue classes of the integers

Definition / Question Definition: Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition ...
11
votes
0answers
499 views

Groups generated by 3 involutions

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
2
votes
0answers
208 views

Characterization of the elements of an infinite simple group

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
12
votes
1answer
783 views

God's number for the $n \times n \times n$-cube

This is a question about Rubik's Cube and generalizations of this puzzle, such as Rubik's Revenge, Professor's cube or in general the $n \times n \times n$ cube. Let $g(n)$ be the smallest number ...
5
votes
3answers
353 views

Computability and complexity of computing $|Hom(G,H)|$ for finitely presented groups G, H.

In the general case, I want to say that determining $|Hom(G,H)|$ is incomputable, arguing that you could use the number to test for simplicity of a presentation, but I am new to this area and I keep ...
4
votes
1answer
316 views

Finding groups of odd order without non-cyclic nilpotent quotients

I hope that my question is appropriate for MO, since it might turn out te be mainly a question about GAP or other group theory software. Is there an algorithm to produce all non-nilpotent groups ...
4
votes
1answer
1k views

How to generate all finite groups of order n? [closed]

I know how to generate all Abelian groups of order n, but how would I generate the others? I can't seem to find anything about this. By "generate", I mean produce the Cayley tables for all groups of ...
6
votes
1answer
483 views

Testing permutations to see if they generate $S_n$

Alright, so a similar question was recently asked about the theoretical bound for generating certain permutations in polynomial time. I had been thinking about a related problem in algorithms (with ...