
TL;DR
This paper explores five divisibility orders on the Stone-ch compactification of natural numbers, characterizing their structure and comparing their strength to the Rudin-Keisler order.
Contribution
It introduces and analyzes five divisibility orders on ch ch compactification, identifying their maximal, minimal elements, and their relation to Rudin-Keisler order.
Findings
Identified antichains of incompatible elements.
Characterized maximal and minimal elements.
Proved two divisibility orders are stronger than Rudin-Keisler order.
Abstract
We consider five divisibility orders on the Stone-\v{C}ech compactification . We find antichains of incompatible elements, and characterize maximal and minimal elements. The main result shows that two of these relations, and , are strictly stronger than the Rudin-Keisler order.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
