Date Thesis Awarded


Access Type

Honors Thesis -- Access Restricted On-Campus Only

Degree Name

Bachelors of Science (BS)




Sarah Day

Committee Members

Anh Ninh

Greg Smith

Yu-Min Chung


Conley Index theory has inspired the development of rigorous computational methods to study dynamics. These methods construct outer approximations, combinatorial representations of the system, which allow us to represent the system as a combination of two graphs over a common vertex set. Invariant sets are sets of vertices and edges on the resulting digraph. Conley Index theory relies on isolated invariant sets, which are maximal invariant sets that meet an isolation condition, to describe the dynamics of the system. In this work, we present a computationally efficient and rigorous algorithm for computing all isolated invariant sets given an outer approximation. We improve upon an existing algorithm that “grows” iso- lated invariant sets individually and requires an input size of 2n, where n is the number of grid elements used for the outer approximation.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

On-Campus Access Only