Skip to main content

Questions tagged [computational-group-theory]

Filter by
Sorted by
Tagged with
4 votes
1 answer
266 views

Are (group theoretic) Markov properties on groups with decidable word problems, decidable?

(Link to SE duplicate: https://math.stackexchange.com/questions/4959071/are-group-theoretic-markov-properties-on-groups-with-decidable-word-problems) The Adian-Rabin theorem says that if a property of ...
Perry Bleiberg's user avatar
4 votes
1 answer
379 views

Where to begin in Computational Group Theory?

I'm coding a small application that looks for periodic solutions to the gravitational n-body problem. I'm trying to better understanding the symmetries of solutions, which is made up of the product of ...
G. Fougeron's user avatar
4 votes
2 answers
221 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 ...
manzana's user avatar
  • 345
4 votes
4 answers
485 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 $...
Sebastien Palcoux's user avatar
4 votes
1 answer
446 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 of ...
Tom De Medts's user avatar
  • 6,614
4 votes
1 answer
423 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): ...
Sebastien Palcoux's user avatar
4 votes
1 answer
398 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 ...
Nikolas Breuckmann's user avatar
4 votes
1 answer
274 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.$$ ...
Francesco Polizzi's user avatar
4 votes
1 answer
350 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. ...
Gro-Tsen's user avatar
  • 32.5k
4 votes
0 answers
115 views

Complexity to find "short" (e.g. polynomial in diameter) decomposition of the permutation into the product of generators?

Question 1: Consider the symmetric group $S_n$ and some set of permutations $p_i$. Given permutation $g$ - what is known about the algorithmic complexity to decompose $g$ into product of $p_i$ ...
Alexander Chervov's user avatar
4 votes
0 answers
166 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 ...
Todor Antic's user avatar
4 votes
0 answers
199 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$ ...
Sebastien Palcoux's user avatar
3 votes
1 answer
500 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
3 votes
1 answer
226 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....
Bernhard Boehmler's user avatar
3 votes
1 answer
193 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,...
Sebastien Palcoux's user avatar
3 votes
1 answer
133 views

Determine if a 2-cocycle is zero in $H^2(G,\mathbb C^\times)$

Let $G$ be a finite group with trivial action on $\mathbb C^\times$. And given a 2-cocycle $\alpha$ in its Schur multiplier group $H^2(G,\mathbb C^\times)$, as an explicit map from $G\times G\to \...
JKDASF's user avatar
  • 231
3 votes
0 answers
164 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 ...
Anthony Labarre's user avatar
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 ...
Sebastien Palcoux's user avatar
2 votes
2 answers
365 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 $|[...
Sebastien Palcoux's user avatar
2 votes
1 answer
191 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]}}$ ...
Shiquan Ren's user avatar
  • 1,990
2 votes
1 answer
254 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 ...
Sebastien Palcoux's user avatar
2 votes
0 answers
229 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 ...
Seewoo Lee's user avatar
  • 2,215
2 votes
0 answers
75 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)? ...
Joseph Van Name's user avatar
2 votes
0 answers
154 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 ...
Sebastien Palcoux's user avatar
2 votes
0 answers
261 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 ...
Stefan Kohl's user avatar
  • 19.6k
1 vote
2 answers
411 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)...
Sebastien Palcoux's user avatar
1 vote
1 answer
431 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 ...
Sebastien Palcoux's user avatar
1 vote
1 answer
225 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 ...
Sebastien Palcoux's user avatar
1 vote
0 answers
87 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 ...
Pierre's user avatar
  • 2,287
1 vote
0 answers
61 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 ...
Vasac's user avatar
  • 11
1 vote
0 answers
104 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
1 vote
1 answer
318 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 ...
Joseph Van Name's user avatar
1 vote
0 answers
81 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 \...
Sebastien Palcoux's user avatar
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, $(...
Sebastien Palcoux's user avatar
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 ...
Turbo's user avatar
  • 13.9k
0 votes
1 answer
342 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 K(...
Syed's user avatar
  • 601
0 votes
1 answer
81 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|}$, ...
M.H.Hooshmand's user avatar
0 votes
0 answers
106 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:...
Zhaochen Ding's user avatar
0 votes
0 answers
274 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 ...
Jerry Halisberry's user avatar
0 votes
0 answers
99 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 ...
J Bausch's user avatar
0 votes
0 answers
111 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 ...
Igor Rivin's user avatar
  • 96.4k
0 votes
1 answer
330 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 ...
Exodd's user avatar
  • 201
0 votes
0 answers
461 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 ...
Pankaj Sejwal's user avatar

1
2