A special class of interval graphs is defined and characterized, and an algorithm is given for their construction. These graphs are motivated by an important representation of DNA called restriction maps by molecular biologists. Circular restriction maps are easily included.
Interval mapping graphs and periodic points of continuous functions
β Scribed by Uhland Burkart
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 598 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let f be a continuous map of an interval I/R. The periods of the periodic points of f are described by a theorem of Sarkovskii [6,12], which defines an ordering in the set N\* of all positive integers in such a way that if n # N\* is a period of x # I, every integer following n in Sarkovskii's order
It is proved that a point 4 from the Tech-Stone remainder N\* is a P-point iff C,(N$) is a hereditary Baire space, where II4 = N U (4;). S ome characterizations of P-points in terms of games played in FY4 and C\*(W,) are also given.
We consider a piecewise continuous, piecewise monotone interval map and a weight of bounded variation, constant on homtervals and continuous at periodic points of the map. With these data we associate a sequence of weighted MilnorThurston kneading matrices, converging to a countable matrix with coef