Graduate Thesis Or Dissertation
Minimal functions on the random permutation Public Deposited
https://scholar.colorado.edu/concern/graduate_thesis_or_dissertations/9593tv15x
- Abstract
- The random permutation is the Fraïssé limit of the class of finite structures with two linear orders. Using a recent Ramsey-theoretic technique, we determine 13 finitary operations which generate the minimal polymorphism clones containing the automorphism group of the random permutation; we call such operations minimal functions. We also show that every reduct of the random permutation is model-complete and, answering a problem stated by Peter Cameron in 2002, we prove that there are 39 closed groups containing the automorphism group of the random permutation.
- Creator
- Date Issued
- 2016
- Academic Affiliation
- Advisor
- Committee Member
- Degree Grantor
- Commencement Year
- Subject
- Last Modified
- 2019-11-16
- Resource Type
- Rights Statement
- Language
Relationships
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
minimalFunctionsOnTheRandomPermutation.pdf | 2019-11-11 | Public | Download |