Mahurin Honors College Capstone Experience/Thesis Projects

Department

Honors Academy- (Honors Self-Design Major)

Additional Departmental Affiliation

Mathematics

Document Type

Thesis

Abstract

We look at locally convex topologies on a totally ordered finite set. We determine a method of finding an upper bound on the number of such topologies on an n element. We show how this problem is related to Pascal’s Triangle and the Fibonacci Numbers. We explain an algorithm for determining the number of locally convex topologies consisting of nested intervals.

Advisor(s) or Committee Chair

Dr. Tom Richmod

Disciplines

Mathematics | Physical Sciences and Mathematics

Download

Included in

Mathematics Commons

Share

COinS