Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 98 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 112 tok/s Pro
Kimi K2 165 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4 29 tok/s Pro
2000 character limit reached

The rank of the inverse semigroup of all partial automorphisms on a finite crown (2204.13961v1)

Published 29 Apr 2022 in math.RA

Abstract: For $n \in \mathbb{N}$, let $[n] = {1, 2, \ldots, n}$ be an $n$ - element set. As usual, we denote by $I_n$ the symmetric inverse semigroup on $[n]$, i.e. the partial one-to-one transformation semigroup on $[n]$ under composition of mappings. The crown (cycle) $\cal{C}_n$ is an $n$-ordered set with the partial order $\prec$ on $[n]$, where the only comparabilities are $$1 \prec 2 \succ 3 \prec 4 \succ \cdots \prec n \succ 1 \mbox{ or } 1 \succ 2 \prec 3 \succ 4 \prec \cdots \succ n \prec 1.$$ We say that a transformation $\alpha \in I_n$ is order-preserving if $x \prec y$ implies that $x\alpha \prec y\alpha$, for all $x, y $ from the domain of $\alpha$. In this paper, we study the inverse semigroup $IC_n$ of all partial automorphisms on a finite crown $\cal{C}_n$. We consider the elements, determine a generating set of minimal size and calculate the rank of $IC_n$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.