Tagged Questions

Computational algebra is an area of algebra that seeks efficient algorithms to answer fundamental problems concerning basic algebraic objects (groups, rings, fields, etc.). For questions about generic computer algebra systems, use [tag:computer-algebra-systems].

800 views

Recovering a finite group's structure from the order of its elements.

Suppose you know the following two things about a group $G$ with $n$ elements: the order of each of the $n$ elements in $G$; $G$ is uniquely determined by the orders in (1). Question: How ...
769 views

What is computational group theory?

What is computational group theory? What is the difference between computational group theory and group theory? Is it an active area of the mathematical research currently? What are some of the ...
483 views

Most wanted reproducible results in computational algebra

I am interested in suggestions for major computational results obtained with the help of mathematical software but not easily verifiable using computers. "Most wanted" could refer, for example, to ...
299 views

Enumerating Bianchi circles

Background: Katherine Stange describes Schmidt arrangements in "Visualising the arithmetic of imaginary quadratic fields", arXiv:1410.0417. Given an imaginary quadratic field $K$, we study the Bianchi ...
162 views

The equivalence classes of $N\sim M\Leftrightarrow G/N\cong G/M$.

Let $G$ be a finite group. Given some $N\unlhd G$, define $$\mathfrak{C}_N:=\{M\unlhd G : G/M \cong G/N\}.$$ How are the subgroups in $\mathfrak{C}_N$ related? Is there some other description ...
207 views

Any abstract algebra book with programming (homework) assignment?

All: I had studied abstract algebra long time ago. Now, I would like to review some material, particularly about Galois theory (and its application). Can anyone recommend an abstract algebra book ...
300 views

Is it “often known” how to compute a list of groups?

From the introduction of the article Construction of Finite Groups written by Hans Ulrich Besche and Bettina Eick: When attempting to determine up to isomorphism the groups of a given order it is ...
269 views

Applications of computation on very large groups

I have been studying computational group theory and I am reading and trying to implement these algorithms. But what that is actually bothering me is, what is the practical advantage of computing all ...
96 views

308 views

Number of Irreducible Factors of $x^{63} - 1$

I have to find the number of irreducible factors of $x^{63}-1$ over $\mathbb F_2$ using the $2$-cyclotomic cosets modulo $63$. Is there a way to see how many the cyclotomic cosets are and what is ...
125 views

Can someone explain how the Schreier-Sims Algorithms works on a permutation group with a simple example?

Can someone explain how the Schreier-Sims Algorithms works on a permutation group with a simple example? All the books I read have a dense notation that hard to comprehend but a simple and concrete ...
509 views

Lower central series of a free group

Consider the element $w=x^2yx^{-1}y^{-1}x^{-1}yxy^{-1}x^{-1}$ of the free group $F_2=\langle x,y\rangle$. By considering the image of this element under the abelianization map (equivalently, by adding ...
490 views

GAP semidirect product algorithm

Can anybody guide me towards, or possibly even explain here, the algorithm that GAP uses to compute the semidirectproduct of two permutation groups which outputs another permutation group? EXAMPLE: ...
142 views

Is the group $G_{n,\phi} = \langle x_1 , \dots, x_n \mid x_i^2, (x_i x_j)^4, x_i x_{\phi(i)} x_{i+1} x_{\phi(i)} \rangle$ abelian?

I am working on a family of finitely presented groups and I asking me the following question. Let $\phi$ be an application from $\left\{1,\dots,n\right\}$ to $\left\{1,\dots,n\right\}$ (not necessary ...
569 views

How to find presentation of a group using GAP?

I have a group from Small Group Library and I want to find its presentation using GAP. I have tried to use PresentationFpGroup(G) but failed. Please suggest me a method.
230 views

Algorithm design for enumerating pairs of noncommuting elements up to conjugacy

I am trying to write some Magma code that, given a group $G$, returns a list of pairs $(x,y)$ with $x,y\in G$ such that $[x,y]\neq 1$ and such that every pair $(z,w)$ in the group with $[z,w]\neq 1$ ...
132 views

Conjugacy classes of PSL(6,7)

I need the conjugacy class sizes of projective special linear group PSL(6,7). I couldn't find it by using GAP. Could someone find it?
190 views

how to begin self study of computational group theory.

Today in class on finite group theory our professor taught us Mathieu groups and so we dealt with Steiner system and similar. He said from here on you can pursue computational group theory and start ...
120 views

Number of subgroups of order $4$ and $8$ in a group of order $72$

Let $G$ be a group of order $72$. I want to calculate the number of subgroups of order $4$ and $8$ with GAP. How can I do? thanks in advance.
380 views

Check whether two subgroup of $GL(n,\mathbb Z)$ are conjugate

Suppose I have two finite subgroups of $GL(n,\mathbb Z)$. Is there an algorithm to find out whether these two belong to the same conjugacy class in $GL(n,\mathbb Z)$? I tried by using the Jordan ...
709 views

97 views

Division by factorized polynomials in Macaulay2

I have this problem dividing by factorized polynomials, for example (x_1^4-x_2^4)//(factor(x_1^2-x_2^2)) does not work because the numerator is of "class R" (R is the ring kk[x_1..x_n]) and the ...
130 views

GAP Responding Time

I am running GAP 4.6.5 on my six-year-old computer and sometimes it takes like forever for GAP to respond to my simple commands. An easy example is as follows: ...
207 views

414 views

49 views

How to find the smallest set of generating elements in a group?

Is there a systematic procedure for finding the smallest set of generating elements of a finite group?
52 views

Software for computing generators of the invariant rings of the symmetric groups

(Please skip to the last paragraph if you are interested in just the question) I wish to compute the generators of the ring of invariants for a symmetric group acting on a polynomial ring using a ...
32 views

Algorithmic computing kernel of a graded homomorpism

For computing kernel of a module homomorphism we can use module-Grobner basis such as described in notes talking about computing SyZyGies. How can we compute kernel of a homomorphism between a graded ...
90 views

Software for Braid Groups

I am looking for software/online tool that works on Braid Groups. I am aware that there are resources that allows you to draw braids by imputing generators or detect whether two braids are equivalent ...
26 views

Has there been work on computational group theory applications to computing colimits of crosses n-cubes of groups?

I'm trying to compute homotopy groups of a few spaces using crossed n-cubes of groups. I'm able to describe a few colimits in terms of quotients of induced crossed modules and nonabelian tensor ...