2000 character limit reached
On a Conjecture by Hayashi on Finite Connected Quandles
Published 19 May 2024 in math.CO | (2405.11660v1)
Abstract: A quandle is an algebraic structure whose binary operation is idempotent, right-invertible and right self-distributive. Right-invertibility ensures right translations are permutations and right self-distributivity ensures further they are automorphisms. For finite connected quandles, all right translations have the same cycle structure, called the profile of the connected quandle. Hayashi conjectured that the longest length in the profile of a finite connected quandle is a multiple of the remaining lengths. We prove that this conjecture is true for profiles with at most five lengths.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.