The free idempotent generated locally inverse semigroup

The free idempotent generated locally inverse semigroup In this paper we construct a model for the free idempotent generated locally inverse semigroup on a set X. The elements of this model are special vertex-labeled bipartite trees with a pair of distinguished vertices. To describe this model, we need first to introduce a variation of a model for the free pseudosemilattice on a set X presented in Auinger and Oliveira (On the variety of strict pseudosemilattices. Stud Sci Math Hungarica 50:207–241, 2013). A construction of a graph associated with a regular semigroup was presented in Brittenham et al. (Subgroups of free idempotent generated semigroups need not be free. J Algebra 321:3026–3042, 2009) in order to give a first example of a free regular idempotent generated semigroup on a biordered set E with non-free maximal subgroups. If G is the graph associated with the free pseudosemilattice on X, we shall see that the models we present for the free pseudosemilattice on X and for the free idempotent generated locally inverse semigroup on X are closely related with the graph G. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Semigroup Forum Springer Journals

The free idempotent generated locally inverse semigroup

Loading next page...
 
/lp/springer_journal/the-free-idempotent-generated-locally-inverse-semigroup-Al8kphcOpI
Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media, LLC
Subject
Mathematics; Algebra
ISSN
0037-1912
eISSN
1432-2137
D.O.I.
10.1007/s00233-017-9882-5
Publisher site
See Article on Publisher Site

Abstract

In this paper we construct a model for the free idempotent generated locally inverse semigroup on a set X. The elements of this model are special vertex-labeled bipartite trees with a pair of distinguished vertices. To describe this model, we need first to introduce a variation of a model for the free pseudosemilattice on a set X presented in Auinger and Oliveira (On the variety of strict pseudosemilattices. Stud Sci Math Hungarica 50:207–241, 2013). A construction of a graph associated with a regular semigroup was presented in Brittenham et al. (Subgroups of free idempotent generated semigroups need not be free. J Algebra 321:3026–3042, 2009) in order to give a first example of a free regular idempotent generated semigroup on a biordered set E with non-free maximal subgroups. If G is the graph associated with the free pseudosemilattice on X, we shall see that the models we present for the free pseudosemilattice on X and for the free idempotent generated locally inverse semigroup on X are closely related with the graph G.

Journal

Semigroup ForumSpringer Journals

Published: Jul 12, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off