相关论文: Homogeneity of Inverse Semigroups
Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…
In this paper we show that if $Y$ is a subsemilattice of a finite semilattice indecomposable semigroup $S$ then $|Y|\leq 2\left\lfloor \frac{|S|-1}{4}\right\rfloor+1$. We also characterize finite semilattice indecomposable semigroups $S$…
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and…
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…
Classically, an abelian group $G$ is said to be slender if every homomorphism from the countable product $\mathbb Z^{\mathbb N}$ to $G$ factors through the projection to some finite product $\mathbb Z^n$. Various authors have proposed…
Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…
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…
Let $S$ be an inverse semigroup with zero and let $Z(S)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b)…
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…
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not…
We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…
An inverse Clifford semigroup (often referred to as just a Clifford semigroup) is a semilattice of groups. It is an inverse semigroup and in fact, one of the earliest studied classes of semigroups. In this short note, we discuss various…
A completely inverse $AG^{**}$-groupoid is a groupoid satisfying the identities $(xy)z=(zy)x$, $x(yz)=y(xz)$ and $xx^{-1}=x^{-1}x$, where $x^{-1}$ is a unique inverse of $x$, that is, $x=(xx^{-1})x$ and $x^{-1}=(x^{-1}x)x^{-1}$. First we…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
The 5-element Brandt semigroup $B_2$ admits the structure of a naturally semilattice-ordered inverse semigroup, thus becoming an additively idempotent semiring with the operation of taking greatest lower bounds as the semiring addition. For…
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…
This is an expository paper which provides a quick introduction to Boolean inverse semigroups and their type monoids, with the emphasis on techniques and insights of the theory, and also treats the connection of the type monoid…
$E$-Ehresmann semigroups are a commonly studied generalization of inverse semigroups. They are closely related to Ehresmann categories in the same way that inverse semigroups are related to inductive groupoids. We prove that under some…