Free Combinatorial Strict Inverse Semigroups

DOI10.1112/jlms/s2-39.1.102zbMath0636.20032OpenAlexW2051518176MaRDI QIDQ3775721

Norman R. Reilly

Publication date: 1989

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-39.1.102

zbMATH Keywords

word problemsemilatticesnumber of elementsfree objectscombinatorial Brandt semigrouplattice of varieties of inverse semigroupsnumber of idempotentsbirooted directed graphsnumber of \({\mathcal D}\)- classes

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Lattices of varieties (08B15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items

THE SEMIDIRECTLY CLOSED PSEUDOVARIETY GENERATED BY APERIODIC BRANDT SEMIGROUPS ⋮ The word problem for the bifree combinatorial strict regular semigroup ⋮ Commutativity of operators on the lattice of existence varieties ⋮ Bifree objects in e-varieties of strict orthodox semigroups and the lattice of strict orthodox *-semigroup varieties ⋮ Finite orthodox locally idempotent semigroups having no finite basis of biidentities. ⋮ Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes ⋮ ON RESIDUALLY FINITE VARIETIES OF INVOLUTION SEMIGROUPS ⋮ Word problem of the Perkins semigroup via directed acyclic graphs. ⋮ Monoids with sub-log-exponential free spectra. ⋮ On semidirectly closed pseudovarieties of aperiodic semigroups ⋮ The globals of pseudovarieties of ordered semigroups containingB₂and an application to a problem proposed by Pin

This page was built for publication: Free Combinatorial Strict Inverse Semigroups