Combinatorics of partial wreath power of finite inverse symmetric semigroup $\mathcal{IS}_d$
Eugenia Kochubinska

TL;DR
This paper investigates the combinatorial structure of the partial wreath power of the finite inverse symmetric semigroup, including calculations of its order, idempotents, and D-classes.
Contribution
It provides explicit combinatorial formulas and properties for the partial wreath power of $ ext{IS}_d$, advancing understanding of its algebraic structure.
Findings
Calculated the order of the partial wreath power.
Counted the number of idempotents.
Determined the number of D-classes.
Abstract
We study some combinatorial properties of partial wreath -th power of the semigroup . In particular, we calculate its order, the number of idempotents and the number of D-classes.
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 · Limits and Structures in Graph Theory · Advanced Combinatorial Mathematics
