Questions tagged [computational-group-theory]

Filter by
Sorted by
Tagged with
4 votes
0 answers
202 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 ...
user avatar
  • 3,463
15 votes
1 answer
727 views

Conjugated subgroups in $\mathsf{GL}(m+n,\mathbb{Z})$ implies conjugated subgroups in $\mathsf{GL}(n,\mathbb{Z})$?

In my research I came up with the following question: Question: Let $H_1$ and $H_2$ be finite abelian subgroups of $\mathsf{GL}(n,\mathbb{Z})$. Define $$ H_1'=\left\{\begin{pmatrix} I_m &0\\0&...
user avatar
0 votes
0 answers
66 views

Do there exist methods for determining the orbits of a group action on the cartesian product of sets?

Suppose that we have some group $G$ acting on some set $\Omega$. Then $G$ acts on $\Omega^n = \Omega \times \cdots \times \Omega$ ($n$ times) naturally. I wonder, is there an iterative algorithm to ...
user avatar
  • 161
8 votes
1 answer
274 views

Is there a algorithm to compute the Schur multiplier of a finite group from a group presentation

Suppose we have a finite group $G$ whose presentation or Cayley table is given. Is there an algorithm (at least theoretically - without considering computational complexity) to compute the Cayley ...
user avatar
0 votes
0 answers
150 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 ...
user avatar
5 votes
0 answers
134 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 ...
user avatar
4 votes
2 answers
157 views

Algorithm for root system of Coxeter group generated by permutations

Suppose we are given a group $G$ in terms of generators $t_1, ..., t_n$ which are order 2 in $S_m$ (however we don't assume anything other than that these elements generate $G$ and have order 2). What ...
user avatar
  • 195
3 votes
1 answer
250 views

A global code for the character table of PSL(2,q)

We can easily get the character table of $\mathrm{PSL}(2,q)$ for some fixed small prime power $q$, we can just do (for example): ...
user avatar
4 votes
1 answer
213 views

Isomorphism of semidirect products of surface groups

Recall that the fundamental group of a closed Riemann surface of genus $h$ has the presentation $$\Pi_h= \langle a_1, \,b_1, \ldots, a_h,\, b_h \; | \; [a_1, \, b_1]\ldots [a_h, \, b_h]=1 \rangle.$$ ...
user avatar
1 vote
2 answers
315 views

Are the character degrees determined by the conjugacy class sizes?

The computation below (part 1) shows that if two finite groups of order at most $100$ have the same (ordered) list of conjugacy class sizes, then they also have the same (ordered) list of (irreducible)...
user avatar
3 votes
1 answer
206 views

Can MAGMA compute almost projective $kG$-homomorphisms?

Let $G$ be a finite group and $k$ be a finite field (big enough) whith char$(k)=p$ and $p\mid |G|$. Let $M$ be a finitely generated $kG$-module. We denote the first syzygy of $M$ by $\Omega(M)$, i.e....
user avatar
4 votes
1 answer
244 views

Where or how can I find matrix representatives of the conjugacy classes of Conway's group Co₀?

I would like to find ($24\times 24$) matrices representing the various conjugacy classes of Conway's group $\mathrm{Co}_0$ acting on the Leech lattice in the usual coordinate system given by the MOG. ...
user avatar
  • 21.7k
8 votes
2 answers
735 views

Groups without factorization

A group G is said to have a factorization if there exist proper subgroups $A$ and $B$ such that $G = AB = \{ ab \ | \ a \in A, b \in B \}$. The paper Factorisations of sporadic simple groups (...
user avatar
1 vote
1 answer
386 views

The sporadic numbers

Let call $n$ a sporadic number if the set of groups $G \neq A_n,S_n$ having a core-free maximal subgroup of index $n$ is non-empty and contains only sporadic simple groups. By GAP, the set of all the ...
user avatar
3 votes
1 answer
166 views

Maximal factorization of finite simple groups and no extra intermediate

The book The maximal factorizations of the finite simple groups and their automorphism groups (by Martin W. Liebeck, Cheryl E. Praeger and Jan Saxl) provides a classification of all the triples $(G,A,...
user avatar
2 votes
0 answers
152 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 ...
user avatar
  • 1,201
0 votes
0 answers
69 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 ...
user avatar
24 votes
5 answers
4k views

Are there any computational problems in groups that are harder than P?

There are several well known classes of groups for which the word problem, conjugacy etc. are solvable in polynomial time (hyperbolic, automatic). Then there are several classes of groups like ...
user avatar
  • 351
9 votes
0 answers
142 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$ ...
user avatar
7 votes
2 answers
733 views

Research in applied algebra

I am in my final year of my doctoral study in Mathematics, where my research topic is $p$-groups, specifically classification of $p$-groups by coclass. My work involves a great deal of computation in ...
user avatar
  • 243
26 votes
2 answers
1k views

Is the cohomology ring of a finite group computable?

Is there an algorithm which halts on all inputs that takes as input a finite group ($p$-group if you like) and outputs a finite presentation of the cohomology ring (with trivial coefficients $\mathbb{...
user avatar
3 votes
0 answers
132 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 ...
user avatar
9 votes
1 answer
642 views

A stronger version of a problem of Kenneth Brown using representations

Let $G$ be a finite group and $\mathcal{L}(G)$ its subgroup lattice. Let $\mu$ be the Möbius function on $\mathcal{L}(G)$. The reduced Euler characteristic of the order complex of the coset poset $\{ ...
user avatar
1 vote
0 answers
78 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 &...
user avatar
9 votes
1 answer
182 views

Detecting/Characterising positive elements in free groups

Let $X$ be a set, and let $F(X)$ be the free group generated by $X$. I will say that an element of $F(X)$ is positive if it is in the monoid generated by all the conjugates in $F(X)$ of every member ...
user avatar
  • 1,626
2 votes
0 answers
64 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)? ...
user avatar
3 votes
0 answers
125 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 ...
user avatar
1 vote
1 answer
281 views

How quickly can one compute the Hurwitz action of braid groups on finite groups?

Let $G$ be a finite group. Define the Hurwitz action of $B_{n}$ on $G^{n}$ by letting $(x_{1},...,x_{n})\sigma_{i}=(x_{1},...,x_{i}x_{i+1}x_{i}^{-1},x_{i},x_{i+2},...,x_{n})$. I wonder what algorithms ...
user avatar
0 votes
0 answers
105 views

minimal permutation representations [duplicate]

Suppose I have a finite group $G.$ How hard is it to find the (a?) minimal degree permutation representation of $G?$ The second part of the question is: is there a table of such (hopefully for ...
user avatar
  • 93.7k
8 votes
0 answers
428 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 ...
user avatar
4 votes
3 answers
432 views

What are the rank 3 boolean intervals [H,G], with G simple group?

The rank $n$ boolean lattice $B_{n}$ is the subset lattice of $\{1,2, \dots , n\}$. The lattice $B_{3}$ is the following: Question: What are the rank $3$ boolean intervals of the form $[H,G]$, with $...
user avatar
5 votes
0 answers
88 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, ...
user avatar
2 votes
2 answers
317 views

A good upper-bound for the cardinal of an interval of finite groups

This post is a relative version of General bound for the number of subgroups of a finite group Let $[H,G]$ be a interval of finite groups with $|G:H| = n$. Question: What is a good upper-bound of $|[...
user avatar
2 votes
0 answers
149 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 ...
user avatar
4 votes
1 answer
293 views

Torsion-free, normal subgroups of certain Coxeter groups

Let $G$ be the reflection group of a regular, 4-dimensional, hyperbolic honeycomb. I would like to find a family $H_i < G$ of finite-index, torsion-free subgroups of $G$, so that I can represent ...
user avatar
1 vote
0 answers
77 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 \...
user avatar
6 votes
1 answer
606 views

Positivity of the alternating sum of indices for boolean interval of finite groups

Let $G$ be a finite group and $H$ a subgroup such that the interval $[H,G]$ is a boolean lattice. Let $L_1, \dots , L_n$ be the maximal subgroups of $G$ containing $H$. Let the alternative sum ...
user avatar
0 votes
1 answer
75 views

About $c(A)$ in $c(A)|A|\leq |A^{-1}A|$

Let $G$ be a finite group, $\emptyset\neq A\subseteq G$, $A^{-1}:=\{ a^{-1}:a\in A\}$, and put $$c(A):=\max\{t\in \mathbb{Z}: t|A|\leq |A^{-1}A|\}$$ It is clear that $1\leq c(A)\leq \frac{|G|}{|A|}$, ...
user avatar
2 votes
1 answer
171 views

programming to compute kernel quotient image of a $\mathbb{Z}$-module endomorphism

Let the integers $n\geq 2$, $k\geq 1$, $v=0$ or $1$ and $n_1,\cdots,n_k\geq 1$ such that $$ \sum_{i=1}^k n_i+v=n. $$ Define $P_a^b=0$ if both $a,b$ are odd and $P_a^b={{[a/2]}\choose {[(a+b)/2]}}$ ...
user avatar
  • 1,940
0 votes
1 answer
294 views

Computational Algebra and Symbolic Computation - Where? [closed]

Following the line of this question, I'm in my last year of M.Sc., and I'm looking for a place where I can start my PHD. Since that question has been asked 4 years ago, I thought it may be wise to ask ...
user avatar
  • 191
9 votes
1 answer
218 views

Is a boolean interval of finite groups linearly primitive?

Let $[H,G]$ be an interval of finite groups. Definition: Let $W$ be a representation of $G$, and $X$ a subspace of $W$. Let the fixed-point subspace $W^{H}:=\{w \in W \ \vert \ kw=w \ , \forall h \...
user avatar
3 votes
1 answer
351 views

Is there a way to find an efficient set of relations for presenting the subgroup generated by two matrices in $SL(2, q)$?

Given two elements $a, b \in SL(2, \mathbb{F}_q)$, is there a way to find an efficient presentation $$\langle x, y \mid \text{relations}\rangle$$ of the subgroup $\langle a, b \rangle$? My intention ...
user avatar
44 votes
1 answer
2k views

Transitivity on $\mathbb{N}_0$ -- a 42 problem

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 ...
user avatar
  • 17.9k
1 vote
0 answers
177 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, $(...
user avatar
1 vote
1 answer
218 views

Is a prime index inclusion of finite groups, separating?

Let $(H \subset G)$ be an inclusion of finite groups. Let $\{ g_i \ \vert \ i \in I=[1, \dots ,n] \}$ a subset of $G$ of double coset representatives, i.e. $$G = \coprod_{i \in I} Hg_iH$$ On the ...
user avatar
10 votes
2 answers
568 views

Computing a transversal of a subgroup $H$ of $G$ in expected $O(|G : H|^2 \log |G : H| + |H|)$ time

I have the book "Handbook of Computational Group Theory", by Derek Holt, and in it is a section on finding the transversal of a subgroup. Recall a transversal of a subgroup $H$ of $G$ is a single ...
user avatar
3 votes
0 answers
189 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$ ...
user avatar
5 votes
1 answer
1k views

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$ is cyclic iff it admits no two different subgroups with the same order. proof: see ...
user avatar
5 votes
1 answer
307 views

Is there a nonabelian finite simple group with Grothendieck ring of multiplicity one?

Let $G$ be a finite group. It admits finitely many irreducible complex representations $H_1, \dots, H_r$ which generate, for $\oplus$ and $\otimes$, the Grothendieck ring $\mathcal{G}(G)$ of $G$ (also ...
user avatar
11 votes
0 answers
670 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 ...
user avatar
  • 17.9k