The number of positions starting a square in binary words
From MaRDI portal
Publication:625366
zbMATH Open1209.68398MaRDI QIDQ625366FDOQ625366
Authors: Tomi Kärki, Dirk Nowotka, Tero Harju
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/227834
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (10)
- Constructing words with high distinct square densities
- Partial words with a unique position starting a square
- How many squares must a binary sequence contain?
- On \(k\)-abelian palindromes
- On the number of frames in binary words
- The simplest binary word with only three squares
- How many square occurrences must a binary sequence contain?
- A stronger square conjecture on binary words
- A note on the number of squares in a word
- Squares in partial words
This page was built for publication: The number of positions starting a square in binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625366)