Timeline for Algorithm to check is representation irreducible ? Algorithm to decompose the reducible one ?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2012 at 20:13 | comment | added | Duchamp Gérard H. E. | [May I kindly ask you to look at ...] I just did and have no idea about the average case. The worst case seems to be provided by the free algebra because no relation cuts the exploration tree. Let me think of it. | |
| Nov 5, 2012 at 20:06 | comment | added | Duchamp Gérard H. E. | Sorry for late comment. We didn't examine the complexity in the paper because we had to compute and could not find any equivalent algo in the litterature. We use a set of generators as alphabet. The algorithm automatically computes (in principle) a presentation of the module. After one can compute the indecomposable projectors. I will prepare a rough explanation of the philosophy asap. | |
| Nov 4, 2012 at 10:49 | comment | added | Alexander Chervov | Thank you very much for your answer ! I will look at your paper. May I ask you what is the complexity (in size of group) of your algorithm ? (worst case/average) ? May I kindly ask you to look at mathoverflow.net/questions/111444/… | |
| Nov 4, 2012 at 4:47 | history | answered | Duchamp Gérard H. E. | CC BY-SA 3.0 |