Hostname: page-component-848d4c4894-mwx4w Total loading time: 0 Render date: 2024-06-21T21:28:55.160Z Has data issue: false hasContentIssue false

Minimal combinatorial models for maps of an interval with a given set of periods

Published online by Cambridge University Press:  20 June 2003

LOUIS BLOCK
Affiliation:
Department of Mathematics, University of Florida, Gainesville, FL 32611-8105, USA (e-mail: block@math.ufl.edu)
ETHAN M. COVEN
Affiliation:
Department of Mathematics, Wesleyan University, Middletown, CT 06459-0128, USA
WILLIAM GELLER
Affiliation:
Department of Mathematics, IUPUI, Indianapolis, IN 46202-3216, USA
KRISTIN HUBNER
Affiliation:
Department of Mathematics, Wesleyan University, Middletown, CT 06459-0128, USA Innosoft International Inc., 1050 Lakes Drive, West Covina, CA 91790, USA.

Abstract

A combinatorial model for a property of continuous self-maps of a compact interval is a self-map \pi of a finite ordered set such that every continuous \pi-weakly monotone self-map of a compact interval has that property. We identify the minimal combinatorial models for the property ‘the set of periods is a given set’. Here the word minimal refers to the number of points in the domain of the model. We also identify the minimal permutation models and, in appropriate cases, the minimal combinatorial models for properties involving ‘horseshoes’.

Type
Research Article
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)