The rank of the inverse semigroup of all partial automorphisms on a finite crown

Abstract

For n ∈ N, let [n] = \1, 2, …, n\ be an n - element set. As usual, we denote by In the symmetric inverse semigroup on [n], i.e. the partial one-to-one transformation semigroup on [n] under composition of mappings. The crown (cycle) Cn is an n-ordered set with the partial order on [n], where the only comparabilities are 1 2 3 4 ·s n 1 ~~ or ~~ 1 2 3 4 ·s n 1. We say that a transformation α ∈ In is order-preserving if x y implies that xα yα, for all x, y from the domain of α. In this paper, we study the inverse semigroup ICn of all partial automorphisms on a finite crown Cn. We consider the elements, determine a generating set of minimal size and calculate the rank of ICn.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…