加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本