2017
DOI: 10.1007/s00233-017-9846-9
|View full text |Cite
|
Sign up to set email alerts
|

Ranks of ideals in inverse semigroups of difunctional binary relations

Abstract: The set D n of all difunctional relations on an n element set is an inverse semigroup under a variation of the usual composition operation. We solve an open problem of Kudryavtseva and Maltcev (2011), which asks: What is the rank (smallest size of a generating set) of D n ? Specifically, we show that the rank of D n is B(n) + n, where B(n) is the nth Bell number. We also give the rank of an arbitrary ideal of D n . Although D n bears many similarities with families such as the full transformation semigroups an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…α) = |X \codom(α)|, and call these parameters the rank, domain, codomain, kernel, cokernel, defect and codefect of α respectively. East and Vernitski [1] characterised Green's relations on (a result which is also to be found in [3] in slightly different form). Proof.…”
Section: Theorem 25: ([5]mentioning
confidence: 86%
“…α) = |X \codom(α)|, and call these parameters the rank, domain, codomain, kernel, cokernel, defect and codefect of α respectively. East and Vernitski [1] characterised Green's relations on (a result which is also to be found in [3] in slightly different form). Proof.…”
Section: Theorem 25: ([5]mentioning
confidence: 86%