The Automorphism Conjecture for Ordered Sets of Width $\leq 11$ (Version 2)
Combinatorics
2023-05-24 v1
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 . Subsequent investigations show that the method presented here could lead to a resolution of the Automorphism Conjecture.
Cite
@article{arxiv.2305.13438,
title = {The Automorphism Conjecture for Ordered Sets of Width $\leq 11$ (Version 2)},
author = {Bernd S. W. Schröder},
journal= {arXiv preprint arXiv:2305.13438},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2209.09312