The number of runs in a ternary word

Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2010
Pages178-181
Number of pages4
Publication statusPublished - 2010
EventPrague Stringology Conference 2010, PSC 2010 - Prague, Czech Republic
Duration: Aug 30 2010Sep 1 2010

Other

OtherPrague Stringology Conference 2010, PSC 2010
CountryCzech Republic
CityPrague
Period8/30/109/1/10

Fingerprint

Ternary
Likely
Binary
Observation

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Bannai, H., Giraud, M., Kusano, K., Matsubara, W., Shinohara, A., & Simpson, J. (2010). The number of runs in a ternary word. In Proceedings of the Prague Stringology Conference 2010 (pp. 178-181)

The number of runs in a ternary word. / Bannai, Hideo; Giraud, Mathieu; Kusano, Kazuhiko; Matsubara, Wataru; Shinohara, Ayumi; Simpson, Jamie.

Proceedings of the Prague Stringology Conference 2010. 2010. p. 178-181.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bannai, H, Giraud, M, Kusano, K, Matsubara, W, Shinohara, A & Simpson, J 2010, The number of runs in a ternary word. in Proceedings of the Prague Stringology Conference 2010. pp. 178-181, Prague Stringology Conference 2010, PSC 2010, Prague, Czech Republic, 8/30/10.
Bannai H, Giraud M, Kusano K, Matsubara W, Shinohara A, Simpson J. The number of runs in a ternary word. In Proceedings of the Prague Stringology Conference 2010. 2010. p. 178-181
Bannai, Hideo ; Giraud, Mathieu ; Kusano, Kazuhiko ; Matsubara, Wataru ; Shinohara, Ayumi ; Simpson, Jamie. / The number of runs in a ternary word. Proceedings of the Prague Stringology Conference 2010. 2010. pp. 178-181
@inproceedings{d35531b9238641d0ac219d77ffb9f695,
title = "The number of runs in a ternary word",
abstract = "It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters.",
author = "Hideo Bannai and Mathieu Giraud and Kazuhiko Kusano and Wataru Matsubara and Ayumi Shinohara and Jamie Simpson",
year = "2010",
language = "English",
isbn = "9788001045978",
pages = "178--181",
booktitle = "Proceedings of the Prague Stringology Conference 2010",

}

TY - GEN

T1 - The number of runs in a ternary word

AU - Bannai, Hideo

AU - Giraud, Mathieu

AU - Kusano, Kazuhiko

AU - Matsubara, Wataru

AU - Shinohara, Ayumi

AU - Simpson, Jamie

PY - 2010

Y1 - 2010

N2 - It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters.

AB - It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters.

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

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

M3 - Conference contribution

SN - 9788001045978

SP - 178

EP - 181

BT - Proceedings of the Prague Stringology Conference 2010

ER -