Square-density increasing mappings
From MaRDI portal
Publication:3449366
DOI10.1007/978-3-319-23660-5_14zbMATH Open1333.68222OpenAlexW2272542839MaRDI QIDQ3449366FDOQ3449366
Authors: Florin Manea, Shinnosuke Seki 
Publication date: 4 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_14
Recommendations
Cites Work
- Title not available (Why is that?)
- How many squares can a string contain?
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- A \(d\)-step approach for distinct squares in strings
- How many double squares can a string contain?
- A stronger square conjecture on binary words
Cited In (11)
- Constructing words with high distinct square densities
- Characterization of dense patterns having distinct squares
- Clusters of repetition roots forming prefix chains
- Square network on a word
- Distinct squares in circular words
- The length of the longest sequence of consecutive FS-double squares in a word
- Prefix frequency of lost positions
- Lower bounds for the number of repetitions in 2D strings
- The square density of words having a sequence of FS-double squares
- An upper bound of the number of distinct powers in binary words
- A stronger square conjecture on binary words
This page was built for publication: Square-density increasing mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449366)
