2008
DOI: 10.1007/s00233-008-9123-z
|View full text |Cite
|
Sign up to set email alerts
|

Semitransitive subsemigroups of the symmetric inverse semigroups

Abstract: We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric semigroup of the minimal cardinality modulo the classification of transitive subgroups of the minimal cardinality of finite symmetric groups.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…In this paper we continue the research started in [4]. There we described the semitransitive subsemigroups of I n of the minimal cardinality.…”
Section: Introductionmentioning
confidence: 93%
See 3 more Smart Citations
“…In this paper we continue the research started in [4]. There we described the semitransitive subsemigroups of I n of the minimal cardinality.…”
Section: Introductionmentioning
confidence: 93%
“…8, 9, 10}. Let G be the four-element cyclic group acting on X 2 generated by the cycle (3,5,4,6). The elements of the semigroup (G × T )/I as the semigroup of partial permutation on X are as follows:…”
Section: Classification Of Semitransitive Subsemigroupsmentioning
confidence: 99%
See 2 more Smart Citations
“…The technique to prove it is inspired by [28] and uses the assumption of being weakly directed (this notion has appeared in [28, 10.1, p. 60] as semi-transitive, but the latter term has been introduced in [26] to designate a different semigroup property recurring in a number of articles, e.g. [4,5,6,7,14,15]). Hence, we say that an action of a semigroup S on a set A is weakly directed if for all a, b ∈ A there are f, g ∈ S and c ∈ A such that (f, c) → a and (g, c) → b.…”
Section: Stronger Reconstruction For Monoids and Clonesmentioning
confidence: 99%