{
  "id": "1011.3402",
  "version": "v1",
  "published": "2010-11-15T14:32:56.000Z",
  "updated": "2010-11-15T14:32:56.000Z",
  "title": "Entropy for symbolic dynamics with overlapping alphabets",
  "authors": [
    "Fabio Drucker",
    "David Richeson",
    "Jim Wiseman"
  ],
  "comment": "15 pages",
  "categories": [
    "math.DS"
  ],
  "abstract": "We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of entropies of (standard) full shifts. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborhoods, the entropy gives a lower bound for the topological entropy of the dynamical system.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-11-15T14:32:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "37B10",
      "37B40"
    ],
    "keywords": [
      "symbolic dynamics",
      "overlapping alphabets",
      "shift space",
      "overlaps arises",
      "discrete dynamical system"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1011.3402D"
    }
  }
}