The Automorphism Conjecture for Ordered Sets of Width ≤ 11 (Version 2)
Abstract
We introduce a recursive method to deconstruct the automorphism group of an ordered set. By connecting this method with deep results for permutation groups, we prove the Automorphism Conjecture for ordered sets of width less than or equal to 11. Subsequent investigations show that the method presented here could lead to a resolution of the Automorphism Conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.