Words, tilings and combinatorial spectra
Morita, Jun ; Terui, Akira
Hiroshima Math. J., Tome 39 (2009) no. 1, p. 37-60 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We will introduce some combinatorics for given words. Such combinatorics can essentially determine the exact information of letters as well as the patterns of words. This method can induce a characterization of the so-called local indistinguishability for one dimensional tilings, which allows us to have a new development for tiling bialgebras. Using those combinatorics associated with words and one dimensional tilings, we can obtain their combinatorial spectra as certain sets of functions or positive real numbers. We will also discuss higher dimensional tilings. Furthermore, we will try to compute some genome examples.
Publié le : 2009-03-15
Classification:  tiling,  word,  bialgebra,  combinatorics,  bioinformatics,  52C23,  68R15,  16W30 
@article{1237392379,
     author = {Morita, Jun and Terui, Akira},
     title = {Words, tilings and combinatorial spectra},
     journal = {Hiroshima Math. J.},
     volume = {39},
     number = {1},
     year = {2009},
     pages = { 37-60},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1237392379}
}

Morita, Jun; Terui, Akira. Words, tilings and combinatorial spectra. Hiroshima Math. J., Tome 39 (2009) no. 1, pp.  37-60. http://gdmltest.u-ga.fr/item/1237392379/