Translator Disclaimer
March 2009 Words, tilings and combinatorial spectra
Jun Morita, Akira Terui
Hiroshima Math. J. 39(1): 37-60 (March 2009). DOI: 10.32917/hmj/1237392379

Abstract

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.

Citation

Download Citation

Jun Morita. Akira Terui. "Words, tilings and combinatorial spectra." Hiroshima Math. J. 39 (1) 37 - 60, March 2009. https://doi.org/10.32917/hmj/1237392379

Information

Published: March 2009
First available in Project Euclid: 18 March 2009

zbMATH: 1171.68656
MathSciNet: MR2499197
Digital Object Identifier: 10.32917/hmj/1237392379

Subjects:
Primary: 16W30, 52C23, 68R15

Rights: Copyright © 2009 Hiroshima University, Mathematics Program

JOURNAL ARTICLE
24 PAGES


SHARE
Vol.39 • No. 1 • March 2009
Back to Top