Classification of Connected Shelves
Mohamed Elhamdadi, Neranga Fernando, Mathew Goonewardena

TL;DR
This paper classifies small connected shelves, explores their group structures, and introduces a new polynomial invariant, contributing to the understanding of finite algebraic structures called shelves.
Contribution
It provides a complete classification of connected shelves with fewer than six elements and proposes a new polynomial invariant for shelves.
Findings
Classified all connected shelves of order less than six.
Analyzed the group structure generated by latin shelves.
Introduced a two-variable shelf polynomial and conjecture for idempotent shelves.
Abstract
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group structure generated by the rows of \textit{latin} shelves. We also define two-variable shelf polynomial by analogy with the quandle polynomial and then state a conjecture about connected idempotent shelves.
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
TopicsAlgebraic structures and combinatorial models · Commutative Algebra and Its Applications · Advanced Combinatorial Mathematics
