Words, tilings and combinatorial spectra

Access this Article

Search this Article

Author(s)

    • Morita Jun
    • Institute of Mathematics University of Tsukuba Tsukuba, Ibaraki, 305-8571 Japan
    • Terui Akira
    • Institute of Mathematics University of Tsukuba Tsukuba, Ibaraki, 305-8571 Japan

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.

Journal

  • Hiroshima mathematical journal

    Hiroshima mathematical journal 39(1), 37-60, 2009-03

    Hiroshima University

Codes

  • NII Article ID (NAID)
    110007014252
  • NII NACSIS-CAT ID (NCID)
    AA00664323
  • Text Lang
    ENG
  • ISSN
    00182079
  • Data Source
    NII-ELS 
Page Top