Related papers: Semi-biproducts of monoids
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
We introduce two partially overlapping classes of pathwise dualities between interacting particle systems that are based on commutative monoids (semigroups with a neutral element) and semirings, respectively. For interacting particle…
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
In this paper there are considered some scalar valued groupoid bihomomorphism structures, being in fact the groupoid counterparts of the inner product notion originally defined for vectors. These bihomomorphisms, called here the semi-inner…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…
This paper constructs a foundation to analyze semi-group actions, group actions, filtrations, and decompositions in a unified manner. In fact, though the studies of decomposition can be applied to foliated spaces and group actions, they can…
In this paper, we introduce and investigate \emph{bisemialgebras}and\emph{\ Hopf semialgebras} over commutative semirings. We generalize to the semialgebraic context several results on bialgebras and Hopf algebras over rings including 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…
The construction of bases for quotients is an important problem. In this paper, applying the method of rewriting systems, we give a unified approach to construct sections---an alternative name for bases in semigroup theory---for quotients…
We propose two universal constructions of globalization of a partial action of a semigroup on a set, satisfying certain conditions which arise in Morita theory of semigroups. One of the constructions is based on the tensor product of a…
If a compact closed category has finite products or finite coproducts then it in fact has finite biproducts, and so is semi-additive.
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
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…
In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter…
Given an action of a groupoid by isomorphisms on a Fell bundle (over another groupoid), we form a semidirect-product Fell bundle, and prove that its $C^{*}$-algebra is isomorphic to a crossed product.
It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
We modify the well-known tensor product of modules over a semiring, in order to treat modules over hyperrings, and, more generally, for bimodules (and bimagmas) over monoids. The tensor product of residue hypermodules is functorial. Special…
The semijoin operation is a fundamental operation of relational algebra that has been extensively used in query processing. Furthermore, semijoins have been used to formulate desirable properties of acyclic schemas; in particular, a schema…