English
Related papers

Related papers: Regular semigroups weakly generated by idempotents

200 papers

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

Commutative Algebra · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

We study algebraic properties of the semigroup $\mathscr{O\!\!I\!}_n(L)$ of finite partial order isomorphisms of the rank $\leq n$ of an infinite linearly ordered set $(L,\leqslant)$. In particular we describe its idempotents, the natural…

Group Theory · Mathematics 2024-12-31 Oleg Gutik , Maksym Shchypel

We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…

Rings and Algebras · Mathematics 2023-08-22 Jelena Radović , Nebojša Mudrinski

In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits a…

Logic · Mathematics 2025-07-28 Eduardo Magalhães

In this paper we present a new embedding of a semigroup into a semiband (idempotent-generated semigroup) of depth 4 (every element is the product of 4 idempotents) using a semidirect product construction. Our embedding does not assume that…

Group Theory · Mathematics 2019-06-04 Luis Oliveira

An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…

Group Theory · Mathematics 2017-06-27 K. Hansda

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

Formal Languages and Automata Theory · Computer Science 2020-07-17 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter

In this paper, we define and study a particular case of von Neumann regular notion called a weak von Neumann regular ring. It shown that the polynomial ring $R[x]$ is weak von Neumann regular if and only if $R$ has exactly two idempotent…

Commutative Algebra · Mathematics 2010-02-03 Mohammed Kabbour , Najib Mahdou

Let $\mathcal C$ be a class of $T_1$ topological semigroups, containing all Hausdorff zero-dimensional topological semigroups. A semigroup $X$ is $\mathcal C$-$closed$ if $X$ is closed in any topological semigroup $Y\in\mathcal C$ that…

General Topology · Mathematics 2022-09-05 Taras Banakh , Myroslava Vovk

Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…

Algebraic Topology · Mathematics 2015-09-08 Clara Loeh

Lee and Kwon [12] defined an ordered semigroup S to be completely regular if a 2 (a2Sa2] for every a 2 S. We characterize every completely regular ordered semigroup as a union of t-simple subsemigroups, and every Clifford ordered semigroup…

Rings and Algebras · Mathematics 2017-01-06 Anjan Kumar Bhuniya , Kalyan Hansda

The semigroup $\mathbf{I}\mathbb{N}_{\infty}$ of all partial co-finite isometries of positive integers is studied. We describe Green's relations on the semigroup $\mathbf{I}\mathbb{N}_{\infty}$, its band and proved that…

Group Theory · Mathematics 2019-04-16 Oleg Gutik , Anatolii Savchuk

In order to investigate the relationship between weak amenability and the Haagerup property for groups, we introduce the weak Haagerup property, and we prove that having this approximation property is equivalent to the existence of a…

Operator Algebras · Mathematics 2014-01-22 Søren Knudby

Every semigroup containing an ideal subgroup is called a homogroup, and it is a grouplike if and only if it has only one central idempotent. On the other hand, a class of algebraic structures covering group-$e$-semigroups…

Group Theory · Mathematics 2024-10-02 M. H. Hooshmand

We have shown recently that, given a metric space $X$, the coarse equivalence classes of metrics on the two copies of $X$ form an inverse semigroup $M(X)$. Here we study the property of idempotents in $M(X)$ of being finite or infinite,…

Metric Geometry · Mathematics 2021-03-09 V. Manuilov

The note contains a few results related to separation axioms and automatic continuity of operations in compact-like semitopological groups. In particular, is presented a semiregular semitopological group $G$ which is not $T_3$. We show that…

General Topology · Mathematics 2019-08-09 Alex Ravsky

Does every one-ended $CAT(0)$ group have semistable fundamental group at infinity? As we write, this is an open question. Let $G$ be such a group acting geometrically on the proper $CAT(0)$ space $X$. In this paper we show that in order to…

Group Theory · Mathematics 2020-10-14 Ross Geoghegan , Eric Swenson

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

We provide short and direct proofs for some classical theorems proved by Howie, Levi and McFadden concerning idempotent generated semigroups of transformations on a finite set.

Group Theory · Mathematics 2011-02-01 João Araújo