Subball complexity and Sturmian colorings of regular trees (Natural extension of arithmetic algorithms and S-adic system)

機関リポジトリ (HANDLE) オープンアクセス
  • Kim, Dong Han
    Department of Mathematics Education, Dongguk University-Seoul・School of Mathematics, Korea Institute for Advanced Study

この論文をさがす

説明

The subball complexity of colorings of regular trees is a generalized of the subword complexity or factor complexity of infinite words. The Sturmian word which exhibits the smallest subword complexity among non-eventually periodic word can be obtained in geometric way using the irrational circle rotation or the projection of a line of irrational slope. We survey the Sturmian coloring or trees and the subball complexity of colorings of a tree associated to isometries of the hyperbolic plane with a tessellation of the hyperbolic plane.

収録刊行物

キーワード

詳細情報 詳細情報について

  • CRID
    1050845763390657280
  • NII論文ID
    120006715312
  • NII書誌ID
    AA12196120
  • ISSN
    18816193
  • HANDLE
    2433/243579
  • 本文言語コード
    en
  • 資料種別
    departmental bulletin paper
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ