Posets of Copies of Countable Ultrahomogeneous Tournaments
Abstract
The poset of copies of a relational structure X is the partial order P ( X ) := \ Y ⊂ X: Y X\, ⊂ and each similarity of such posets (e.g. isomorphism, forcing equivalence) determines a classification of structures. We consider the countable ultrahomogeneous tournaments: Q (the rational line), S (2) (the circular tournament), and T ∞ (the random tournament); as well as the ultrahomogeneous digraphs S (3), Q [ In], S (2)[ In] and T ∞ [ In] from Cherlin's list. If G Rado (resp. Q n) denotes the countable homogeneous universal graph (resp. n-labeled linear order), it turns out that P ( T ∞) P ( GRado) and that P ( Q n) densely embeds in P ( S (n)), for n∈\ 2,3\. Consequently, B X ro\, ( S π), where S is the Sacks forcing and 1 S "π is a separative, atomless and σ-closed forcing", whenever X is a countable structure equimorphic with Q, Q n, S (2), S (3), Q [ In] or S (2)[ In]. Also, B X ro\, ( S π), where 1 S "π is an ω-distributive forcing", whenever X is a countable graph embedding G Rado, or a countable tournament embedding T ∞, or X = T ∞ [ In].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.