Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Are three squares impossible?

From MaRDI portal
Publication:5169580
Jump to:navigation, search

zbMATH Open1291.68309MaRDI QIDQ5169580FDOQ5169580


Authors: W. F. Smyth Edit this on Wikidata


Publication date: 10 July 2014





Recommendations

  • The three squares lemma revisited
  • Large-scale detection of repetitions
  • Repetitions in strings: algorithms and combinatorics
  • scientific article; zbMATH DE number 3864532
  • Repetitive perhaps, but certainly not boring


Mathematics Subject Classification ID

Combinatorics on words (68R15)



Cited In (2)

  • Repetitive perhaps, but certainly not boring
  • Title not available (Why is that?)





This page was built for publication: Are three squares impossible?

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5169580&oldid=19730214"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 15:34. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki