Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

How many square occurrences must a binary sequence contain?

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

zbMath1011.05007MaRDI QIDQ1871376

Pascal Ochem, Gregory Kucherov, Michaël Rao

Publication date: 7 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122596



Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)


Related Items (8)

Letter frequency in infinite repetition-free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Constructing Words with High Distinct Square Densities ⋮ On the average number of regularities in a word ⋮ Squares in partial words ⋮ Avoiding or Limiting Regularities in Words ⋮ On \(k\)-abelian palindromes ⋮ On the number of frames in binary words







This page was built for publication: How many square occurrences must a binary sequence contain?

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1871376&oldid=14265238"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki