2015
DOI: 10.1080/00927872.2014.984838
|View full text |Cite
|
Sign up to set email alerts
|

On the Semigroup of Partial Isometries of a Finite Chain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

2
22
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(24 citation statements)
references
References 12 publications
2
22
0
Order By: Relevance
“…First, notice that from [1, Lemma 2.1] we deduce that number of L-classes in K(n, p) = {α ∈ DP n : h(α) = p} (as well as the number of R-classes there) is n p . To describe the D-classes in DP n and ODP n , first we recall (from [1]) that the gap and reverse gap of the image set of α (with h(α) = p) are ordered (p − 1)-tuples defined as follows:…”
Section: Number Of D * -Classesmentioning
confidence: 99%
See 1 more Smart Citation
“…First, notice that from [1, Lemma 2.1] we deduce that number of L-classes in K(n, p) = {α ∈ DP n : h(α) = p} (as well as the number of R-classes there) is n p . To describe the D-classes in DP n and ODP n , first we recall (from [1]) that the gap and reverse gap of the image set of α (with h(α) = p) are ordered (p − 1)-tuples defined as follows:…”
Section: Number Of D * -Classesmentioning
confidence: 99%
“…Analogous to Al-Kharousi et al [2], this paper investigates the combinatorial properties of DDP n and ODDP n , thereby complementing the results in Kehinde et al [13] which dealt mainly with the algebraic and rank properties of these semigroups. In this section we introduce basic definitions and terminology as well as quote some elementary results from Section 1 of Al-Kharousi et al [1] and Kehinde et al [13] that will be needed in this paper. In Section 2 we obtain the cardinalities of two equivalences defined on ODDP n and DDP n .…”
Section: Introductionmentioning
confidence: 99%
“…Observe that ODP n , POI n , DP n and PODI n are all inverse submonoids of the symmetric inverse monoid (i.e. the monoid of all partial permutations) I n on X n (see [3,14]). Obviously, POI n ⊆ PODI n and ODP n = DP n ∩ POI n and, as observed by Al-Kharousi et al [3], we also have DP n ⊆ PODI n .…”
Section: Introductionmentioning
confidence: 99%
“…the monoid of all partial permutations) I n on X n (see [3,14]). Obviously, POI n ⊆ PODI n and ODP n = DP n ∩ POI n and, as observed by Al-Kharousi et al [3], we also have DP n ⊆ PODI n . Moreover, it is easy to check that ODP n = {s ∈ I n | is − js = i − j, for i, j ∈ Dom(s)}.…”
Section: Introductionmentioning
confidence: 99%
“…See also [11], for a survey on known presentations of transformations monoids. We notice that the first author together with Delgado [6,7] have computed the abelian kernels of the monoids POI n and PODI n , by using a method that is strongly dependent of given presentations of the monoids.The study of semigroups of finite partial isometries was initiated by 3]. The first of these two papers is dedicated to investigate some combinatorial properties of the monoid DP n of all partial isometries on {1, .…”
mentioning
confidence: 99%