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

learn more… | top users | synonyms

23
votes
1answer
764 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 ...
5
votes
1answer
468 views

Is there any efficient algorithm for finding subgroups of a given finite group?

I am implementing an algorithm which finds every subgroup of given group. Here's my algorithm. Let $G$ be a group of order $n$ with elements $g_1,\cdots,g_n$. Then I consider each $\langle ...
6
votes
1answer
430 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: ...
16
votes
1answer
651 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 ...
8
votes
1answer
250 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 ...
2
votes
1answer
97 views

do we have any special algorithms or software to find all 2-sylow subgroups of a group?

I am working on a project that involves 2-sylow subgroups of groups,one thing that I need to do is to find all 2-sylow subgroups of a group and check that it is cyclic or not, now my question is that ...
4
votes
2answers
244 views

How to prove that $x^4+x^3+x^2+3x+3 $ is irreducible over ring $\mathbb{Z}$ of integers?

Which criterion (test) one can use in order to prove that $x^4+x^3+x^2+3x+3 $ is irreducible over ring $\mathbb{Z}$ of integers ? Neither of Eisenstein's criterion and Cohn's criterion cannot be ...
3
votes
0answers
147 views

Simplifying Relations in a Group

Let $K$ be the group generated by four elements $x_1,\cdots,x_4$ with relations that any simple commutator with repeated generator is trivial; for example, $[[x_2,[x_1,x_3]],x_3]=1$. As I have asked ...
2
votes
0answers
172 views

Using GAP to compute the abelianization of a subgroup

Let $K$ be the group generated by four elements $x_1,\cdots,x_4$ with relations that each generator commutes with all its conjugates. (An equivalent relation is, any simple commutator with repeated ...
9
votes
1answer
198 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 ...
5
votes
1answer
380 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.
5
votes
2answers
282 views

Find the 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 ...
3
votes
3answers
275 views

Is there a simple way to distinguish between group homomorphisms?

More precisely, I am given a function $f:G\to H$ with the promise that it is a homomorphism. Is there an easy way to determine which homomorphism it is without looking through all of its values? For ...