Square-density increasing mappings

DOI10.1007/978-3-319-23660-5_14MaRDI QIDQ3449366zbMATHOpenAlexFDO

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

zbMATH Keywords

alphabetsquare conjecturesquare-density amplifier

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• A stronger square conjecture on binary words
• A note on the number of squares in a word
• Constructing words with high distinct square densities
• How many square occurrences must a binary sequence contain?
• How many squares can a string contain?

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A \(d\)-step approach for distinct squares in strings
• 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 stronger square conjecture on binary words
• How many double squares can a string contain?
• How many squares can a string contain?

Cited in

(11)

• Prefix frequency of lost positions
• Characterization of dense patterns having distinct squares
• The square density of words having a sequence of FS-double squares
• Distinct squares in circular words
• Clusters of repetition roots forming prefix chains
• The length of the longest sequence of consecutive FS-double squares in a word
• An upper bound of the number of distinct powers in binary words
• Square network on a word
• Constructing words with high distinct square densities
• A stronger square conjecture on binary words
• Lower bounds for the number of repetitions in 2D strings

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)