Beyond the runs theorem

Johannes Fischer; Štěpán Holub; Tomohiro I; Moshe Lewenstein

doi:10.1007/978-3-319-23826-5_27

Beyond the runs theorem

Johannes Fischer, Štěpán Holub, Tomohiro I, Moshe Lewenstein

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

17 Scopus citations

Abstract

In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.

Original language	English
Title of host publication	String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings
Editors	Simon J. Puglisi, Costas S. Iliopoulos, Emine Yilmaz
Publisher	Springer Verlag
Pages	277-286
Number of pages	10
ISBN (Print)	9783319238258
DOIs	https://doi.org/10.1007/978-3-319-23826-5_27
State	Published - 2015
Event	22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 - London, United Kingdom Duration: 1 Sep 2015 → 4 Sep 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9309
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015
Country/Territory	United Kingdom
City	London
Period	1/09/15 → 4/09/15

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2015.

Funding

Štěpán Holub is supported by the Czech Science Foundation grant number 13-01832S. J. Fisher and M. Lewenstein are supported by a Grant from the GIF, the German-Israeli Foundation for Scientific Research and Development.

Funders	Funder number
German-Israeli Foundation for Scientific Research and Development
Grantová Agentura České Republiky	13-01832S

Keywords

Combinatorics on words
Lyndon words
Runs

Access to Document

10.1007/978-3-319-23826-5_27

Cite this

Fischer, J., Holub, Š., I, T., & Lewenstein, M. (2015). Beyond the runs theorem. In S. J. Puglisi, C. S. Iliopoulos, & E. Yilmaz (Eds.), String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings (pp. 277-286). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9309). Springer Verlag. https://doi.org/10.1007/978-3-319-23826-5_27

Fischer, Johannes ; Holub, Štěpán ; I, Tomohiro et al. / Beyond the runs theorem. String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. editor / Simon J. Puglisi ; Costas S. Iliopoulos ; Emine Yilmaz. Springer Verlag, 2015. pp. 277-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{72ca2f8132c24491b6f78c7c65ca33d5,

title = "Beyond the runs theorem",

abstract = "In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.",

keywords = "Combinatorics on words, Lyndon words, Runs",

author = "Johannes Fischer and {\v S}t{\v e}p{\'a}n Holub and Tomohiro I and Moshe Lewenstein",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 ; Conference date: 01-09-2015 Through 04-09-2015",

year = "2015",

doi = "10.1007/978-3-319-23826-5_27",

language = "אנגלית",

isbn = "9783319238258",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "277--286",

editor = "Puglisi, {Simon J.} and Iliopoulos, {Costas S.} and Emine Yilmaz",

booktitle = "String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings",

address = "גרמניה",

}

Fischer, J, Holub, Š, I, T & Lewenstein, M 2015, Beyond the runs theorem. in SJ Puglisi, CS Iliopoulos & E Yilmaz (eds), String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9309, Springer Verlag, pp. 277-286, 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015, London, United Kingdom, 1/09/15. https://doi.org/10.1007/978-3-319-23826-5_27

Beyond the runs theorem. / Fischer, Johannes; Holub, Štěpán; I, Tomohiro et al.
String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. ed. / Simon J. Puglisi; Costas S. Iliopoulos; Emine Yilmaz. Springer Verlag, 2015. p. 277-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9309).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Beyond the runs theorem

AU - Fischer, Johannes

AU - Holub, Štěpán

AU - I, Tomohiro

AU - Lewenstein, Moshe

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.

AB - In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.

KW - Combinatorics on words

KW - Lyndon words

KW - Runs

UR - http://www.scopus.com/inward/record.url?scp=84944682455&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23826-5_27

DO - 10.1007/978-3-319-23826-5_27

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84944682455

SN - 9783319238258

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 277

EP - 286

BT - String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings

A2 - Puglisi, Simon J.

A2 - Iliopoulos, Costas S.

A2 - Yilmaz, Emine

PB - Springer Verlag

T2 - 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015

Y2 - 1 September 2015 through 4 September 2015

ER -

Fischer J, Holub Š, I T, Lewenstein M. Beyond the runs theorem. In Puglisi SJ, Iliopoulos CS, Yilmaz E, editors, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. Springer Verlag. 2015. p. 277-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-23826-5_27

Beyond the runs theorem

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this