Vol. 8, No. 1, 2015

Download this article
Download this article For screen
For printing
Recent Issues

Volume 16
Issue 3, 365–546
Issue 2, 183–364
Issue 1, 1–182

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
The number of convex topologies on a finite totally ordered set

Tyler Clark and Tom Richmond

Vol. 8 (2015), No. 1, 25–32
Abstract

We give an algorithm to find the number Tcvx(n) of convex topologies on a totally ordered set X with n elements, and present these numbers for n 10.

Keywords
convex topology, totally ordered set, number of topologies
Mathematical Subject Classification 2010
Primary: 05A15, 06F30, 54A10, 54F05
Milestones
Received: 19 October 2011
Revised: 14 June 2013
Accepted: 7 August 2013
Published: 10 December 2014

Communicated by Kenneth S. Berenhaut
Authors
Tyler Clark
Department of Mathematics
Western Kentucky University
1906 College Heights Boulevard
Bowling Green, KY 42101
United States
Tom Richmond
Department of Mathematics
Western Kentucky University
1906 College Heights Boulevard
Bowling Green, KY 42101
United States