group algebra
Can anyone help in writing code to find the list of idempotent and primitive elements of a group algebra?
The examples goes like this. Let p be an odd prime such that ˉ2 generates U(Zp2) and let G=(ideal generated by a)∗(ideal generated by b) an abelian group, with o(a)=p2 and o(b)=p.
Then F2G has four inequivalent minimal codes, namely, the ones generated by the idempotents:
e0=ˆG e1=ˆb−^(ideal generated by a)∗(ideal generated by b) e2=^a−G e3=^(ideal generated by ap)∗(ideal generated by b)−ˆG
Is your group finite or infinite? If it's finite, you could hope to write down a linear map, the kernel of which is the space of primitives. If it's infinite, then you need a computational method to implement.
Note: also asked as