Finitely presented algebras defined by permutation relations of dihedral type
Ferran Cedo, Eric Jespers, Georg Klein

TL;DR
This paper studies finitely presented algebras defined by permutation relations of dihedral type, establishing their structure, normal forms, and properties like being automaton algebras and semiprimitive.
Contribution
It introduces a normal form for these algebras, analyzes their properties, and connects their structure to dihedral and semidihedral permutation groups.
Findings
The algebra is an automaton algebra.
The universal group is a unique product group.
The algebra is semiprimitive.
Abstract
The class of finitely presented algebras over a field with a set of generators and defined by homogeneous relations of the form , where runs through a subset of the symmetric group of degree , is investigated. Groups in which the cyclic group is a normal subgroup of index are considered. Certain representations by permutations of the dihedral and semidihedral groups belong to this class of groups. A normal form for the elements of the underlying monoid with the same presentation as the algebra is obtained. Properties of the algebra are derived, it follows that it is an automaton algebra in the sense of Ufnarovski\u{\i}. The universal group of is a unique product group, and it is the…
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
Topicssemigroups and automata theory
