Finite Diagram Semigroups: Extending the Computational Horizon
James East, Attila Egri-Nagy, Andrew R. Francis, James D. Mitchell

TL;DR
This paper broadens the understanding of diagram semigroups by establishing a general framework and expanding computational data, revealing surprising patterns and raising new theoretical questions.
Contribution
It introduces a unified framework for diagram semigroups and significantly extends computational analysis, uncovering novel observations and open research questions.
Findings
Rich computational data set with surprising patterns
Identification of open questions for future research
Extension of the computational horizon for diagram semigroups
Abstract
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our computational knowledge of them. The generated data set is replete with surprising observations raising many open questions for further theoretical research.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Machine Learning and Algorithms
