Notions of complexity in substitution dynamical systems

Graduate Thesis Or Dissertation

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/k930c1602

Descriptions

Attribute Name	Values
Creator	Wing, David Josiah
Abstract	There has been a lot of work done in recent decades in the field of symbolic dynamics. Much attention has been paid to the so-called "complexity" function, which gives a sense of the rate at which the number of words in the system grow. In this paper, we explore this and several notions of complexity of specific symbolic dynamical systems. In particular, we compute positive entropy and state some k-balancedness properties of a few specific (random) substitutions. We also view certain sequences as subsets of Z², stating several properties and computing bounds on entropy in a specific example.
License	All rights reserved
Resource Type	Dissertation
Date Available	2011-06-02T16:44:23+00:00
Date Issued	2011-06-02
Degree Level	Doctoral
Degree Name	Doctor of Philosophy (Ph.D.)
Degree Field	Mathematics
Degree Grantor	Oregon State University
Commencement Year	2011
Advisor	Burton, Robert M., Jr.
Committee Member	Evans, Glenn Garity, Dennis Parks, Hal Schmidt, Tom
Academic Affiliation	Mathematics
Non-Academic Affiliation	Oregon State University. Graduate School
Rights Statement	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/21588

Parents:

This work has no parents.

In Collection:

Thumbnail	Title	Date Uploaded	Visibility	Actions
	WingDavidJ2011.pdf	2017-08-19	Public	Download