Square-density increasing mappings

DOI10.1007/978-3-319-23660-5_14zbMATH Open1333.68222OpenAlexW2272542839MaRDI QIDQ3449366FDOQ3449366

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

• 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?

zbMATH Keywords

alphabetsquare conjecturesquare-density amplifier

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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 (10)

• Characterization of dense patterns having distinct squares
• Clusters of repetition roots forming prefix chains
• Square network on 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
• Constructing Words with High Distinct Square Densities
• Distinct Squares in Circular Words
• Title not available (Why is that?)

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)