English
Related papers

Related papers: Free left and right adequate semigroups

200 papers

The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…

Group Theory · Mathematics 2015-10-09 Tara Brough , Alan J. Cain

In this paper we study regular irreducible algebraic monoids over $\fldc$ equipped with the euclidean topology. It is shown that, in such monoids, the Green classes and the spaces of idempotents in the Green classes all have natural…

Differential Geometry · Mathematics 2011-08-16 V. N. Krishnachandran

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

Group Theory · Mathematics 2023-04-10 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno , Emanuele Rodaro

Almost-direct products of free groups arise naturally in braid theory and in the study of automorphism groups of free groups. Although bi-invariant orderings are known to exist for many such groups, their explicit structure is often left…

Group Theory · Mathematics 2026-04-10 Oscar Ocampo , Juliana Roberta Theodoro de Lima

In this paper we introduce the notion of right waist and right comparizer ideals for semigroups. In particular, we study the ideal theory of semigroups containing right waists and right comparizer ideals. We also study those properties of…

Rings and Algebras · Mathematics 2009-12-16 Nazer. H. Halimi

We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as…

Group Theory · Mathematics 2019-11-19 James East

We consider the general question of how the homological finiteness property left-FPn holding in a monoid influences, and conversely depends on, the property holding in the substructures of that monoid. In particular we show that left-FPn is…

Group Theory · Mathematics 2010-03-17 Robert Gray , Stephen J Pride

In this article we study left I-orders in the bicyclic monoid $\mathcal{B}$. We give necessary and sufficient conditions for a subsemigroup of $\mathcal{B}$ to be a left I-oreder in $\mathcal{B}$. We then prove that any left I-order in…

Group Theory · Mathematics 2011-07-19 Nassraddin Ghroda

A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular…

Group Theory · Mathematics 2017-06-27 A. Jamadar , K. Hansda

We propose a notion of a proper Ehresmann semigroup based on a three-coordinate description of its generating elements governed by certain labelled directed graphs with additional structure. The generating elements are determined by their…

Rings and Algebras · Mathematics 2024-10-29 Ganna Kudryavtseva , Valdis Laan

We initiate the study of expansions of monoids in the class of two-sided restriction monoids and show that generalizations of the Birget-Rhodes prefix group expansion, despite the absence of involution, have rich structure close to that of…

Rings and Algebras · Mathematics 2024-10-29 Ganna Kudryavtseva

For an arbitrary rational polyhedron we consider its decompositions into Minkowski summands and, dual to this, the free extensions of the associated pair of semigroups. Being free for the pair of semigroups is equivalent to flatness for the…

Algebraic Geometry · Mathematics 2020-04-17 Klaus Altmann , Alexandru Constantinescu , Matej Filip

Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…

Rings and Algebras · Mathematics 2018-09-19 Victoria Gould , Miklos Hartmann , Maria Szendrei

We introduce the class of network right $*$-abundant semigroups. These are based on networks that extend the notion of a directed graph. This class properly contains the class of graph inverse semigroups. We investigate the structure of…

Group Theory · Mathematics 2024-11-25 Yanhui Wang , Pei Gao , Xueming Ren

Semigroup actions and their invertible extensions are discussed. First, we develop a theory of natural extensions for continuous actions of countable, embeddable semigroups. Second, we demonstrate that not every surjective such action of a…

Dynamical Systems · Mathematics 2025-07-14 Raimundo Briceño , Álvaro Bustos-Gajardo , Miguel Donoso-Echenique

We study the class of monoids that arise as the submonoid of right units of finitely presented special inverse monoids (SIMs). Gray and Ru\v{s}kuc (2024) gave the first example of a finitely presented SIM whose submonoid of right units does…

Group Theory · Mathematics 2025-12-18 Igor Dolinka , Robert D. Gray

We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…

Group Theory · Mathematics 2007-05-23 Lee Mosher , Michah Sageev , Kevin Whyte

Left Ehresmann monoids, and their two-sided counterpart of Ehresmann monoids, were so named by Lawson, who elucidated their connection to the work of Ehresmann in differential geometry. This article is dedicated to building a theory for…

Rings and Algebras · Mathematics 2026-04-28 Gracinda Gomes , Victoria Gould , Yanhui Wang

We study the free objects in the variety of semigroups and variety of monoids generated by the monoid of all $n \times n$ upper triangular matrices over a commutative semiring. We obtain explicit representations of these, as multiplicative…

Rings and Algebras · Mathematics 2019-04-15 Mark Kambites

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle