Timeline for Algorithm to check is representation irreducible ? Algorithm to decompose the reducible one ?
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11 at 18:37 | comment | added | Student | The link to Max Neunhoffer's note from @TimDokchitser is broken. I suppose this link brings to a similar document math.rwth-aachen.de/homes/Max.Neunhoeffer/Publications/pdf/… | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 3, 2015 at 13:38 | comment | added | Vít Tuček | This is just tangentially related -- decomposing representation on the web using Sage: sheaves.github.io/… | |
| Jan 28, 2015 at 21:31 | answer | added | L.Z. Wong | timeline score: 4 | |
| Nov 10, 2012 at 16:49 | vote | accept | Alexander Chervov | ||
| Nov 4, 2012 at 10:47 | comment | added | Alexander Chervov | Related mathoverflow.net/questions/111444/… | |
| Nov 4, 2012 at 10:22 | comment | added | Tim Dokchitser | To add a bit to Derek Holt's answer, there are two very efficient methods, "Norton's irreducibility criterion" (for your Q1) and "Parker's Meataxe" (for Q2). They were used heavily for the Atlas of finite groups, and they or their extensions (notably by Holt-Rees) seem to remain the most efficient practical methods to work with representations of big groups. Essentially they work over any field, although, as Derek writes, there are issues with Schur indices. The notes by Max Neunhoffer www-groups.mcs.st-and.ac.uk/~neunhoef/Publications/pdf/… give a very nice brief summary. | |
| Nov 4, 2012 at 4:47 | answer | added | Duchamp Gérard H. E. | timeline score: 4 | |
| Nov 4, 2012 at 1:44 | answer | added | Andy B | timeline score: 1 | |
| Nov 3, 2012 at 22:20 | answer | added | Derek Holt | timeline score: 27 | |
| Nov 3, 2012 at 22:07 | comment | added | Dmitri Panov | Qiauchu, Alexander seems to ask about effective algorithms, and not about this basic material you are talking about. | |
| Nov 3, 2012 at 20:41 | comment | added | Qiaochu Yuan | 1) Compute the norm of its character. 2) Compute the character table of the group, then the character of the representation you're looking at. This is basic material in the representation theory of finite groups and not appropriate for MO. | |
| Nov 3, 2012 at 20:36 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
edited title
|
| Nov 3, 2012 at 20:23 | history | edited | Alexander Chervov |
edited tags
|
|
| Nov 3, 2012 at 20:16 | history | asked | Alexander Chervov | CC BY-SA 3.0 |