Questions tagged [computational-group-theory]
The computational-group-theory tag has no usage guidance.
30
questions with no upvoted or accepted answers
17
votes
0
answers
956
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 ...
- 19.5k
12
votes
0
answers
537
views
God's number for higher dimensional Rubik's cubes
In this MO question, user Martin Brandenburg asks about God's number for $n \times n \times n$-cubes for $n>3$. Here, God's number $g(n)$ was defined as the smallest number $m$ such that every ...
- 4,575
12
votes
0
answers
699
views
Solving a set of equations in a finite symmetric group
A standard way to find solutions to a finite set of equations in a finite symmetric group
${\rm S}_n$ is to take the equations as relators of a finitely presented group, to use
the low index subgroups ...
- 19.5k
12
votes
0
answers
538
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
$...
- 19.5k
9
votes
0
answers
187
views
Permutation groups with diameter $O(n \log n)$
I suspect that many permutation puzzles can be solved in $O(n \log n)$ moves, which has led me to the following question/conjecture:
Suppose that
1. $P_i$ for $i<k=O(1)$ are permutations on an $n$ ...
- 6,112
8
votes
0
answers
434
views
A relation between intersection and product on Boolean interval of finite groups
Let $[H,G]$ be a Boolean interval of finite groups (i.e. the lattice of intermediate subgroups $H \subseteq K \subseteq G$, is Boolean). For any element $K \in [H,G]$, let $K^{\complement}$ be its ...
- 25.9k
7
votes
0
answers
300
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 ...
- 19.5k
7
votes
0
answers
1k
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 problem.
...
- 19.5k
5
votes
0
answers
194
views
Tools for computing from group presentations
What are some tools -- either theoretical/by hand or algorithmic/by computer -- that are useful for doing computations in finitely presented groups?
In my particular case, I'm working with a finitely ...
- 1,267
5
votes
0
answers
94
views
Is there an interval of finite groups, at index n, with strictly more elements than the subgroup lattice of any group, of order n?
Let $G$ be a finite group and $\mathcal{L}(G)$ its subgroup lattice.
Let $s(n):= max\{|\mathcal{L}(G)| \text{ for } |G|=n \}$.
There is an OEIS page for the sequence $s(n)$: A018216
1, 2, 2, 5, 2, ...
- 25.9k
5
votes
0
answers
289
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: ...
- 25.9k
5
votes
0
answers
237
views
Finite groups generated by 3 involutions interchanging disjoint residue classes of the integers
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 ...
- 19.5k
4
votes
0
answers
156
views
Is there any good methods for writing down basis for laws of groups?
I am wondering if there is a good method to write down a finite equational basis for a finite group.
Especially I am wondering if there is a good method in following situations:
We can write a group ...
- 93
4
votes
0
answers
197
views
Generalization of the fundamental theorem of cyclic groups 2
This post is a sequel of Generalization of the fundamental theorem of cyclic groups
Let $G$ be a finite group then the fundamental theorem of cyclic groups can be formulated as follows:
Theorem: $G$ ...
- 25.9k
3
votes
0
answers
158
views
Generating sets of the symmetric group that yield isomorphic Cayley graphs
Let $S$ and $S'$ be subsets of size $k$ of $\mathfrak{S}_n$.
Are there any necessary or sufficient conditions to determine whether or not $S$ and $S'$ yield isomorphic Cayley graphs?
Assuming we ...
- 1,154
3
votes
0
answers
128
views
Extension of Tits' theorem on groups with a BN-pair of rank ≥ 3
Tits has proved that a finite simple group $G$ with a BN-pair of rank $n \ge 3$, is of Lie type. Let $B$ be the Borel subgroup and $(W,S)$ the Coxeter system. The subset lattice of the set $S$ is ...
- 25.9k
2
votes
0
answers
206
views
Satake correspondence for groups over finite field
I asked the same question in MSE, but I didn't get any answer. So I decided to post it here, too.
In Langlands' program, Satake correspondence gives a correspondence between unramified ...
- 1,911
2
votes
0
answers
73
views
Is the word problem in the braid group quotient $B_{n}/N$ solvable where $N$ is the normal subgroup generated by conjugates of $\sigma_{i}^{2r}$?
Let $r\geq 2$. Let $N$ be the normal subgroup of $B_{n}$ generated by conjugates of $\sigma_{i}^{2r}$. Then is the word problem in the quotient group $B_{n}/N$ solvable (in polynomial time)? ...
- 27.8k
2
votes
0
answers
150
views
Nonvanishing of the dual Euler totient on boolean intervals of finite groups
The rank $n$ boolean lattice $B_n$, is the subset lattice of $\{1,2, \dotsm n \}$.
Let $[H,G]$ be a boolean interval of finite groups. Its Euler totient is defined by $$\varphi(H,G):=\sum_{K \in ...
- 25.9k
2
votes
0
answers
260
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 ...
- 19.5k
1
vote
0
answers
59
views
Is there any lower bound for basis computation in finite Abelian groups?
Victor Shoup in this paper has given a lower bound for discrete logarithm. The algorithms that I have come across use discrete logarithms (extended discrete logarithms) to compute a basis for a finite ...
- 11
1
vote
0
answers
96
views
Factoring in discrete Heisenberg group $H_3(\mathbb{Z})$
Let $H_3(\mathbb{Z})$ be the discrete Heisenberg group generated by $x=\begin{pmatrix}
1 & 1 & 0\\
0 & 1 & 0\\
0 & 0 & 1\\
\end{pmatrix},\ \ y=\begin{pmatrix}
1 & 0 &...
user6671
1
vote
0
answers
80
views
An optimal lower bound related to generators in a boolean interval of finite groups
Let $[H,G]$ be a rank $n$ boolean interval of finite groups (i.e. $[H,G] \simeq B_n$ as lattice).
Let the set $E = \{ g \in G \ | \ \langle H,g \rangle = G \}$
Remark: If $g \in E$ then $Hg \...
- 25.9k
1
vote
0
answers
179
views
Are the finite groups inclusions, almost all relatively cyclic?
Definition: An inclusion of finite groups $(A \subset B)$ is relatively cyclic if $\exists b \in B$ such that $\langle A,b \rangle = B$.
Definition: Two inclusions of finite groups are equivalent, $(...
- 25.9k
1
vote
0
answers
112
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 ...
- 13.7k
0
votes
0
answers
54
views
complexity of membership problem in finite general linear group
Suppose $G$ is a subgroup of $GL(n,q)$ given by a list of generators. What is known about the complexity of the corresponding "membership problem", that is, the problem of deciding whether a ...
- 2,195
0
votes
0
answers
98
views
A decision problem of an inverse problem in finite group theory
A finite group $G$ is called integral if there is a finite group $H$ such that $G\cong H'$.
In Araujo, Cameron, Casolo, Matucci's paper, integrals of groups, they tried to solve a problem as following:...
0
votes
0
answers
227
views
Algorithm to compute automorphism group of a finite group
Is there an algorithm to compute automorphism group of a finite group?
GAP has a function to do this, but while perusing their GitHub repo, I could not find an implementation. I'm struggling to find ...
0
votes
0
answers
90
views
nauty/traces orbit sizes for colored graph?
I'm given a graph $G$ (<1000 vertices, large automorphism group), and a large number (~10^6-10^10) of different colorings of said graph. I have two tasks.
Calculate the canonical coloring. I can ...
- 91
0
votes
0
answers
436
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 ...
- 133