Timeline for Symmetric polynomial from graphs
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2017 at 16:00 | history | edited | Abdelmalek Abdesselam |
edited tags
|
|
| May 1, 2011 at 18:18 | comment | added | Abdelmalek Abdesselam | see this paper arxiv.org/abs/1104.0589 for a recent line of research involving these graph polynomials | |
| Feb 25, 2011 at 22:13 | vote | accept | Per Alexandersson | ||
| Feb 25, 2011 at 20:08 | answer | added | Abdelmalek Abdesselam | timeline score: 20 | |
| Feb 25, 2011 at 16:57 | history | edited | Per Alexandersson | CC BY-SA 2.5 |
added some extra info
|
| Feb 25, 2011 at 16:55 | comment | added | Per Alexandersson | The road to this question is not that long actually: all symmetric and translation-invariant polynomials are linear combinations of (a subset of) polynomials obtained from multigraphs. For example discriminants. As it turns out that about half of the graphs yield the zero polynomial, it was a natural question... | |
| Feb 25, 2011 at 15:40 | history | edited | Steve Huntsman | CC BY-SA 2.5 |
edited body
|
| Feb 25, 2011 at 15:15 | comment | added | Pedro Martins Rodrigues | You have a misprint in your polynomial, right? It must be $P_{g}(x_{1}, \cdots,x_{n})$ | |
| Feb 25, 2011 at 15:06 | comment | added | Jim Conant | Interesting question. I'd be interested to learn what led you to this question. | |
| Feb 25, 2011 at 12:44 | history | asked | Per Alexandersson | CC BY-SA 2.5 |