Timeline for Bracket of lyndon words?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2018 at 3:24 | comment | added | Duchamp Gérard H. E. | @DavidVercauteren I am now far from closely monitoring this subject, sorry. What you can remark is that, to each Lyndon word is associated a binary tree (see Lothaire, Combinatorics on Words Chapter 5.3). | |
| Nov 17, 2016 at 8:14 | comment | added | David Vercauteren | If anybody's still following this question: Mr Duchamp, you say "little is known on these structure constants". Could you tell us what is known (and where to find it)? More specifically, I'm searching for a formula/algorithm that gives me $[B(a),B(w)] = \sum_u \alpha_u B(u)$ with $a$ a letter, $w$ and the $u$'s Lyndon words, and the $\alpha_u$ numbers (which I understand will be integers). | |
| Jun 17, 2015 at 11:58 | vote | accept | Chitrabhanu | ||
| Jun 8, 2015 at 8:10 | answer | added | Duchamp Gérard H. E. | timeline score: 5 | |
| Jun 7, 2015 at 18:33 | history | edited | darij grinberg | CC BY-SA 3.0 |
edited body
|
| Jun 7, 2015 at 10:36 | answer | added | Vladimir Dotsenko | timeline score: 4 | |
| S Jun 7, 2015 at 9:27 | history | suggested | Duchamp Gérard H. E. | CC BY-SA 3.0 |
put the coefficients $a_{m,n}^{(l)}$ in tensor form so that the "structure constants" problem appears.
|
| Jun 7, 2015 at 9:18 | comment | added | Duchamp Gérard H. E. | Yes it is basic but up to my knowledge very little is known on these structure constants. Do you know more now ? | |
| Jun 7, 2015 at 9:17 | review | Suggested edits | |||
| S Jun 7, 2015 at 9:27 | |||||
| Feb 5, 2013 at 17:14 | comment | added | Chitrabhanu | No combinatorists out there? I think this is a basic enough question! | |
| Jan 31, 2013 at 21:51 | history | asked | Chitrabhanu | CC BY-SA 3.0 |