How many squares must a binary sequence contain?

Fraenkel, Aviezri S.; Simpson, R.Jamie

The Electronic Journal of Combinatorics [electronic only] (1995)

  • Volume: 2, page 1-1
  • ISSN: 1077-8926

How to cite

top

Fraenkel, Aviezri S., and Simpson, R.Jamie. "How many squares must a binary sequence contain?." The Electronic Journal of Combinatorics [electronic only] 2 (1995): 1-1. <http://eudml.org/doc/118610>.

@article{Fraenkel1995,
author = {Fraenkel, Aviezri S., Simpson, R.Jamie},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {length; longest binary string; distinct squares},
language = {eng},
pages = {1-1},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {How many squares must a binary sequence contain?},
url = {http://eudml.org/doc/118610},
volume = {2},
year = {1995},
}

TY - JOUR
AU - Fraenkel, Aviezri S.
AU - Simpson, R.Jamie
TI - How many squares must a binary sequence contain?
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1995
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 2
SP - 1
EP - 1
LA - eng
KW - length; longest binary string; distinct squares
UR - http://eudml.org/doc/118610
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.