# zbMATH — the first resource for mathematics

Finite presentability of HNN extensions of inverse semigroups. (English) Zbl 1088.20035
HNN extensions of inverse semigroups, in which the associated inverse subsemigroups are order ideals of the base, are defined through a construction based on the isomorphism between the categories of inverse semigroups and inductive groupoids. It is proved that if $$S$$ is a finitely generated inverse semigroup then its HNN extension over the inverse subsemigroup $$U$$ is finitely generated if and only if $$U$$ is finitely generated and $$\mathcal J$$-dominated, which means that $$U$$ has a subset of idempotents that dominate $$U$$ with respect to the $$\mathcal J$$-order.
If $$S$$ is finitely presented, a necessary and sufficient condition, which also incorporates $$\mathcal J$$-domination, is found for the corresponding HNN extension to be finitely presented. Interestingly, unlike the case for groups, it is not necessary that $$U$$ is finitely generated and examples highlight this and a range of other behaviours of these HNN extensions.

##### MSC:
 20M18 Inverse semigroups 20M05 Free semigroups, generators and relations, word problems 20M50 Connections of semigroups with homological algebra and category theory
Gpd
Full Text:
##### References:
 [1] DOI: 10.1016/j.jalgebra.2003.09.026 · Zbl 1041.20042 [2] DOI: 10.1006/jabr.1996.0206 · Zbl 0858.20055 [3] DOI: 10.1090/S0002-9947-1978-0515546-8 [4] Higgins P. J., Van Nostrand Reinhold Math. Stud. 32, in: Notes on Categories and Groupoids (1971) [5] Higgins P. J., J. London Math. Soc. 13 pp 145– [6] DOI: 10.1142/3645 [7] Nambooripad K. S., Houston J. Math. 15 pp 249– [8] DOI: 10.1142/S0218196797000277 · Zbl 0892.20036 [9] DOI: 10.1017/S1446788700002639 · Zbl 0987.20042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.