Square network on a word

DOI10.1016/J.TCS.2021.08.004MaRDI QIDQ2243587zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Shinnosuke Seki

Publication date 11 November 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.08.004

zbMATH Keywords

alignmentbordered factorsdistinct squaressquare conjectureword equations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• How many double squares can a string contain?
• How many squares can a string contain?
• A note on the number of squares in a word
• Constructing words with high distinct square densities
• Distinct squares in circular words

Cites work

• 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
• Algorithms on Strings, Trees and Sequences
• Clusters of repetition roots: single chains
• How many double squares can a string contain?
• How many squares can a string contain?
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• Simple intrinsic simulation of cellular automata in oritatami molecular folding model
• Square-density increasing mappings
• Squares, cubes, and time-space efficient string searching
• The ``runs theorem
• Uniqueness Theorems for Periodic Functions

Cited in

(2)

• Clusters of repetition roots forming prefix chains
• Constructing words with high distinct square densities

This page was built for publication: Square network on a word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243587)