The computational-group-theo tag has no wiki summary.

**11**

votes

**0**answers

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

**0**answers

500 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 ...

**5**

votes

**0**answers

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 ...

**4**

votes

**0**answers

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 ...

**2**

votes

**0**answers

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 ...

**1**

vote

**0**answers

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 ...

**1**

vote

**0**answers

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 ...

**0**

votes

**0**answers

130 views

### Computational Ring Theory

I have tried to understand and program CGT algorithms though I am a beginner still. But I never get to hear Computational Ring Theory. Even GAP largely supports Groups Theory. Is there some initiative ...