Timeline for Word combinatorics terminology question
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2022 at 19:02 | vote | accept | Anthony Quas | ||
| Jul 8, 2022 at 7:48 | answer | added | Ville Salo | timeline score: 6 | |
| Jul 6, 2022 at 5:27 | history | edited | YCor |
edited tags
|
|
| Jul 5, 2022 at 22:35 | comment | added | Dan Rust | I would if I had a copy of Lothaire to hand, but unfortunately I don't. Maybe Ville will see the question in the morning. | |
| Jul 5, 2022 at 22:17 | comment | added | Anthony Quas | Thanks @DanRust and all. Any chance this could be posted as an answer that I can accept? | |
| Jul 5, 2022 at 21:41 | comment | added | Dan Rust | Does Lemma 7.4 (the first paragraph of the proof) in this paper: arxiv.org/pdf/2204.06215.pdf answer your question? Actually, it looks like Salo's thesis has a much more general statement (1.3.5 - 1.3.7) villesalo.com/article/SwSCA.pdf | |
| Jul 5, 2022 at 21:11 | comment | added | Dan Rust | 'unbordered' is what I've seen most commonly. They're often used for instance to define non-trivial automorphisms of subshifts, or to show positive entropy of certain subshifts (essentially because of the replacement property/construction that you point out). | |
| Jul 5, 2022 at 21:07 | comment | added | Carl-Fredrik Nyberg Brodda | They are counted on OEIS:A003000. In Russian literature this is often called "hypersimple", and "unbordered", "bifix-free", or "self-overlap free" are all common, too. | |
| Jul 5, 2022 at 20:11 | comment | added | Anthony Quas | @SamHopkins: thanks for this. | |
| Jul 5, 2022 at 20:04 | comment | added | Sam Hopkins | Okay, "bifix-free" is another term for this: encycla.com/Bifix-free_word | |
| Jul 5, 2022 at 19:59 | history | edited | LSpice | CC BY-SA 4.0 |
Missing question mark; [tag:terminology]
|
| Jul 5, 2022 at 19:42 | history | asked | Anthony Quas | CC BY-SA 4.0 |