Canonical forms for operation tables of finiate connected quandles
Chuichiro Hayashi

TL;DR
This paper introduces natural orderings for finite connected quandles, classifies automorphisms based on these orderings, and explores the structure of their operation tables, providing insights into their algebraic properties.
Contribution
It defines natural orderings for finite connected quandles and classifies automorphisms when the operation table exhibits certain cyclic properties.
Findings
Operation tables coincide when permutation *q is a cycle of length n-1.
Every row and column of the operation table contains all elements of Q.
Automorphisms correspond to natural orderings under specific conditions.
Abstract
We introduce a notion of natural orderings of elements of finite connected quandles of order . When the elements of such a quandle are already ordered naturally, any automophism on is a natural ordering. Although there are many natural orderings, the operation tables for such orderings coincide when the permutation is a cycle of length . This leads to the classification of automorphisms on such a quandle. Moreover, it is also shown that every row and column of the operation table of such a quandle contains all the elements of , which is due to K. Oshiro. We also consider the general case of finite connected quandles.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
