Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lyndon-words
Search options questions only
not deleted
user 33047
2
votes
0
answers
556
views
Lyndon basis of free Lie algebras
Let $A = \{a,b,c,d\}$ be a set of totally ordered alphabets, a Lyndon word over $A$ is a word $w$ in $A^*$ such that if $w=uv$ is a factorization of $w$ into non-empty subwords, then $u<v$ in lexicogr …
- 1,269