Timeline for parameterizing polynomial loops in $\mathbb{C}^\times$
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2010 at 17:38 | comment | added | Andrew Stacey | In that case, I do recommend the Segal paper. As I said, it's been a while since I looked at it, but I do remember there being some stuff on generating the polynomial loop group - it stuck in my mind because, off and on, I've been interested in a very similar question. | |
| Aug 27, 2010 at 17:13 | comment | added | solbap | I'm interested in Laurent polynomials as well. I asked this question because of reading this paper arxiv.org/abs/0803.0029; I wanted to see how minimally the loop group can be generated and understanding this monoid seemed like a step in the right direction. | |
| Aug 25, 2010 at 19:07 | comment | added | Andrew Stacey | I'm not sure how relevant the Segal paper will be given that you really want all polynomials (why not all Laurent polynomials, by the way?) as it's really about polynomial loop groups. (And having looked at your webpage I see you already know the Canonical Reference!). However, if you're interested in such things at all then I recommend the Segal paper even if it isn't directly relevant to this question. | |
| Aug 25, 2010 at 18:21 | comment | added | solbap | Thanks for bringing up this point. I am interested in more than just the powers $z^k$ so I do mean submnoid. Thanks for pointing out the second reference from Segal, I hadn't heard of it before. | |
| Aug 25, 2010 at 9:01 | history | answered | Andrew Stacey | CC BY-SA 2.5 |