The Symbolic Dynamics Of Multidimensional Tiling Systems

We prove a multidimensional version of the theorem that every shift of finite type has a power that can be realized as the same power of a tiling system. We also show that the set of entropies of tiling systems equals the set of entropies of shifts of finite type

Notes on the First Rearing and Introduction of Esox masquinongy in Iowa Waters

The Iowa State Conservation Commission purchased 1,535 muskellunge (3/4 to 1-inch fry) in 1960, from Kenu, a Land-O-Lakes, Wisconsin commercial fish hatchery. Siewers Spring State Fish Hatchery and rearing pond facilities were used for the experimental rearing project. Eighty-five fish survived the June 7 to September 30 rearing period. Forty fish were stocked in each of the following Iowa lakes: West Okoboji, Dickinson County and Clear Lake, Cerro Gordo County. Two specimens have subsequently been recovered and identified from each lake

The Decomposition Theorem For Two-Dimensional Shifts Of Finite Type

A one-dimensional shift of finite type can be described as the collection of bi-infinite walks along an edge graph. The Decomposition Theorem states that every conjugacy between two shifts of finite type can be broken down into a finite sequence of splittings and amalgamations of their edge graphs. When dealing with two-dimensional shifts of finite type, the appropriate edge graph description is not as clear; we turn to Nasu\u27s notion of a textile system for such a description and show that all two-dimensional shifts of finite type can be so described. We then define textile splittings and amalgamations and prove that every conjugacy between two-dimensional shifts of finite type can be broken down into a finite sequence of textile splittings, textile amalgamations, and a third operation called an inversion

Putting The Pieces Together: Understanding Robinson’s Nonperiodic Tilings

A discussion of Robinson\u27s nonperiodic tilings and nonperiodic tilings with nonsquare tiles (Penrose and pinwheel)

Renewal Systems, Sharp-Eyed Snakes, And Shifts Of Finite Type

Johnson and Madden look at collections of bi-infinite strings of symbols that occur in several different areas of mathematics and ask whether these collections are the same in some sense. A dynamical systems property called entropy can be used to show that the shifts of finite type are not all conjugate to uniquely decipherable renewal systems

Projectional Entropy In Higher Dimensional Shifts Of Finite Type

Any higher dimensional shift space (X, ℤᵈ) contains many lower dimensional shift spaces obtained by projection onto r-dimensional sublattices L of ℤᵈ where r \u3c d. We show here that any projectional entropy is bounded below by the ℤᵈ entropy and, in the case of certain shifts of finite type satisfying a mixing condition, equality is achieved if and only if the shift of finite type is the infinite product of a lower dimensional projection

The Zinga Zula Man / music by Ben M. Jerome; words by Eduard Madden

Cover: caricature of an African male clothed as a fusion of European servant and Zulu warrior; Publisher: Chas K. Harris (New York)https://egrove.olemiss.edu/sharris_c/1007/thumbnail.jp