Related papers: Adjoining identities and zeros to semigroups
We introduce two notions of algebraic entropy for actions of cancellative right amenable semigroups $S$ on discrete abelian groups $A$ by endomorphisms; these extend the classical algebraic entropy for endomorphisms of abelian groups,…
Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…
The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We survey theory developed over the past 10 years of semirings which need not be additively cancellative. The main feature is a specified ``null ideal'' $\mcA_0$ of a semiring $\mcA,$ taking the place of a zero element, which permits…
A numerical semigroup is an additive submonoid of the natural numbers with finite complement. The size of the complement is called the genus of the semigroup. How many numerical semigroups have genus equal to $g$? We outline Zhai's proof of…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
We compare three approaches to the notion of conjugacy for semigroups, the first one via the transitive closure of the $uv\sim vu$ relation, the second one via an action of inverse semigroups on themselves by partial transformations, and…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1)…
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissibility for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…
For any $n$-ary associative algebra we construct a $\Z_{n-1}$ graded algebra, which is a universal object containing the $n$-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups.
Given two elements $x,y$ of a semigroup $X$ we write $x\lesssim y$ if for every homomorphism $\chi:X\to\{0,1\}$ we have $\chi(x)\le\chi(y)$. The quasiorder $\lesssim$ is called the $binary$ $quasiorder$ on $X$. It induces the equivalence…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…
We study automorphisms of the semigroup $\boldsymbol{B}_{Z\mathbb{}}^{\mathscr{F}}$ with the family $\mathscr{F}$ of inductive nonempty subsets of $\omega$ and prove that the group $\mathbf{Aut}(\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}})$…