Beyond the Runs Theorem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317091" target="_blank" >RIV/00216208:11320/15:10317091 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-23826-5_27" target="_blank" >http://dx.doi.org/10.1007/978-3-319-23826-5_27</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-23826-5_27" target="_blank" >10.1007/978-3-319-23826-5_27</a>
Alternative languages
Result language
angličtina
Original language name
Beyond the Runs Theorem
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-01832S" target="_blank" >GA13-01832S: General algebra and its connections to computer science</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2015)
ISBN
978-3-319-23826-5
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
277-286
Publisher name
SPRINGER INT PUBLISHING AG
Place of publication
CHAM
Event location
London
Event date
Aug 31, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000365863300027