Hostname: page-component-7b9c58cd5d-6tpvb Total loading time: 0 Render date: 2025-03-15T09:39:05.695Z 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.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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