Related papers: On Ehresmann semigroups
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
Inverse semigroups are a class of semigroups whose structure induces a compatible partial order. This partial order is examined so as to establish mirror properties between an inverse semigroup and the semilattice of its idempotent…
We describe the structure of $E-$dense acts over $E-$dense semigroups in an analogous way to that for inverse semigroup acts over inverse semigroups. This is based, to a large extent, on the work of Schein on representations of inverse…
This paper is the first part of a study devoted to description of modular elements in the lattices of semigroup and epigroup varieties. We provide strengthened necessary and sufficient conditions under which a semigroup or epigroup variety…
We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…
In this paper, we introduce some new classes of algebras related to UP-algebras and semigroups, called a left UP-semigroup, a right UP-semigroup, a fully UP-semigroup, a left-left UP-semigroup, a right-left UP-semigroup, a left-right…
A DR-semigroup $S$ (also known as a reduced E-semiabundant or reduced E-Fountain semigroup) is here viewed as a semigroup equipped with two unary operations $D,R$ satisfying finitely many equational laws. Examples include DRC-semigroups…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
In a couple of previous papers, we initiated a systematic study of semihypergroups and had a thorough discussion on certain analytic and algebraic aspects associated to this class of objects. In this article, we introduce and examine…
We ascertain conditions and structures on categories and semigroups which admit the construction of pseudo-products and trace products respectively, making their connection as precise as possible. This topic is modelled on the ESN Theorem…
For a groupoid $S$ with elements $a$ and $b$, if $ba = a$, then $b$ is a left identity of $a$ and $a$ is a right zero of $b$. We define the left identity set of $a$ to be the set of all left identities of $a$ in $S$, and similarly for the…
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
In this paper we investigate graph inverse semigroups which are subsemigroups of compact-like topological semigroups. More precisely, we characterise graph inverse semigroups which admit a compact semigroup topology and describe graph…
We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…
We build on the description of left congruences on an inverse semigroup in terms of the kernel and trace due to Petrich and Rankin. The notion of an inverse kernel for a left congruence is developed. Various properties of both the trace and…
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…
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…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.