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

**2**

votes

**1**answer

146 views

### Classification of indecomposable inclusions $(H \subset G)$ with $G$ decomposable

Definition: A group $G$ is indecomposable if: $G = G_1 \times G_2 \Rightarrow \exists i \ G_i = 1$.
We can generalize the notion of indecomposable from groups to inclusion of groups as ...

**7**

votes

**1**answer

421 views

### Generalization of a theorem of Øystein Ore in group theory

Theorem (Ã˜ystein Ore, 1938): A finite group $G$ is cyclic iff its lattice of subgroups $\mathcal{L}(G)$ is distributive.
Proof: see below.
Let $(H \subset G)$ be an inclusion of finite groups and ...

**5**

votes

**0**answers

64 views

### Uniqueness of the direct product decomposition of inclusions of finite groups

This post is a generalization of Uniqueness of the direct product decomposition of finite groups.
Here we look inclusions of finite groups $(H \subset G)$ instead of just finite groups.
Definition: ...

**4**

votes

**0**answers

105 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

**3**answers

394 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

**0**answers

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

**7**

votes

**1**answer

269 views

### The Simultaneous Conjugacy Problem in the symmetric group $S_N$

We are interested in the following notions in the case $G=S_N$, the symmetric group on
$\{1,\dots,N\}$.
Fix a group $G$ and a number $d$. For $(g_1,\dots,g_d)\in G^d$ and $x\in G$, define
...

**6**

votes

**1**answer

311 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

**1**answer

168 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

**0**answers

99 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

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

**5**

votes

**0**answers

347 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

**0**answers

397 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

508 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

**0**answers

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

**5**

votes

**1**answer

178 views

### Relations in a particular subgroup of the braid group.

I think this should be a 10 minute exercise in a decent computer algebra package - unfortunately I'm hopelessly ignorant of such things, so I'm putting it up here in the hope that someone will be kind ...

**12**

votes

**1**answer

784 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

**3**answers

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

**0**

votes

**1**answer

279 views

### Necessary/Sufficient condition/Algorithm that tells me a function field is a kummer extension

I start my question with an example. Suppose $F/K$ be the function field generated by $x^n - yx^{n-1} - 1 = 0$. It is not a cyclic over K(y), but if I set $t = yx^{n-1}$ then we have $K(x,t) \subset ...

**4**

votes

**1**answer

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

**1**answer

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

**4**

votes

**4**answers

2k views

### Computational Algebra - Where?

Hello.
I'm on my last semester of a math B.Sc. and about to start studying for a math M.Sc in the same institute.
It now seems like a good time to start thinking of a PhD.
I'm interested in both ...

**6**

votes

**1**answer

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