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

learn more… | top users | synonyms

2
votes
1answer
55 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 ...
-1
votes
1answer
97 views

The h-vector of a simplicial complex

Let $S$ be a polynomial ring over a field. I want to find an ideal $ I\subseteq S$ such that $(1,2,3,1,1,1)$ is the $h$-vector of $S/I$. We have a relation between $f$-vector and $h$-vector and ...
4
votes
0answers
95 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 ...
3
votes
0answers
23 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 ...
3
votes
0answers
121 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
36 views

An algorithm for generating a finite group with a finite set of generators

Let $A$ be a finite set of permutations on $\Bbb N$ with finite support. Is there a good efficient algorithm to obtain the subgroup $\left<A\right>$ of the symmetric group ...
2
votes
0answers
103 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 ...
2
votes
0answers
73 views

First order logic in polynomial equations

Have you ever wondered which points on a conic are the intersections of tangent lines of another surface through the origin? More generally, which points on a shape hold some specified relation to all ...
2
votes
0answers
83 views

How to tell if an ideal is absolutely prime

Consider the ideal $I=(ag-ec-1,ah+bg-cf-de)$ of $R=K[a,b,c,d,e,f,g,h]$. Is $I$ prime when $K=\overline{\mathbb{F}}_2$ is the algebraic closure of a field of 2 elements? Can computers answer this ...
1
vote
0answers
45 views

Does this proof that the resultant provides an upper bound for intersection multiplicity look correct?

Let $f,g \in \mathbb{C}[x,y]$ such that $f(0,0)=g(0,0)=0$ and the varieties $V(f)$ and $V(g)$ are both smooth at $(0,0)$ such that the tangent line of $V(f)$ and $V(g)$ is not the $y$ axis. Let ...
1
vote
0answers
48 views

The Command “TzGoGo” in GAP

I am learning GAP and would like to ask one question about a command called "TzGoGo": If $P$ is a finite presentation of a group $G$, then will the eventual result of the command "TzGoGo(P)" be ...
1
vote
0answers
142 views

Necessary and sufficient conditions for Hensel lifting in the multidimensional case

in Multidimensional Hensel lifting, @Hurkyl gave a neat sufficient condition for the existence of $p$-adic liftings in the multidimensional case. I have finally gotten around (but please also see ...
1
vote
0answers
196 views

An Algorithm to Find the Generators of the Radical of a Monomial Ideal

Working over $R=\mathbb{C}[x_1,...,x_n]$, I'm given a ring homomorphism with $i\in{1,...,n}$ and $t\in \mathbb{C}$. $\phi_{i,t}(x_j)=x_j$ for $j\neq i$ to themselves. From this I've proven that an ...
0
votes
0answers
8 views

Calculating Bloch-Wigner dilogarithm

Is there some tool/calculator (or some tables) for explicitly calculating values of the Bloch-Wigner dilogarithm?
0
votes
0answers
58 views

number of symmetries of an arbitrary graph

Given an (undirected) graph G, is there way to (approximately) estimate the order of Aut(G)-- i.e., the number of permutations ...
0
votes
0answers
11 views

Calculus of trigonometric functions based on elliptic Gauss functions?

Considering this 3 concepts: Arithmetic geometric mean Elliptic integral ( in relation to Gauss studies ) Newton's method I'm supposed to be able to write an algorithm to compute trigonometric ...
0
votes
0answers
43 views

Boosting of Coset diagrams

If we have the diagram that represents a transitive permutation representation of $(p,q,r_o)$ for some $p, q$ and $r_o$, we often use this diagram to get diagrams for any $r>r_o$. We can do this ...
0
votes
0answers
55 views

Urgently Seeking for Help in Calculating the Abelian Invariants of a Group with GAP

I have asked a more complicated question here but I decided to start with an easier version: Let $K_3$ be the group generated by three elements $a$, $b$, $c$ subject to the relation that every simple ...
0
votes
0answers
41 views

minmax of hamming weight in a basis for a vector space

Consider the vector space $V=\mathbb{Z}_2^n$ and take some linear subspace $U\subseteq V$ (we can assume we are given some basis for $U$). Now, for every basis $B$ of U, define $f(B)=\max_{b\in ...