Vol. 193, No. 1, 2000

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Simple connectivity of the Markov partition space

L. Badoian and J.B. Wagoner

Vol. 193 (2000), No. 1, 1–4
Abstract

In Wagoner, 1987 the simplicial complex PA of Markov partitions was introduced as a tool for studying the group of automorphisms of a subshift of finite type (XAA) built from a zero-one transition matrix A. Triangles in PA led to the matrix Triangle Identities in Wagoner, Pac. Journal, 1990 which have been used in Wagoner, 1990, 1990, 1990, 1992, Kim, Roush & Wagoner, 1992, and the Williams Conjecture counterexample paper Kim & Roush, to appear.

A key fact about PA is that it is contractible. See Wagoner, 1987. The purpose of this note is to correct the proof on pp. 99-100 in Wagoner, 1987 that PA is simply connected and in the process to improve the bound in Proposition 2.13 of Wagoner, 1987.

Milestones
Received: 5 May 1998
Published: 1 March 2000
Authors
L. Badoian
Department of Mathematics
University of California
Berkeley, CA 94720
J.B. Wagoner
Department of Mathematics
University of California
Berkeley, CA 94720