Related papers: Semiring identities in the semigroup $B_2$
The main aim of this paper is to provide set-theoretical solutions of the Yang-Baxter equation that are not necessarily bijective, among these new idempotent ones. In the specific, we draw on both to the classical theory of inverse…
We describe overcommutative varieties of semigroups whose lattice of overcommutative subvarieties satisfies a non-trivial identity or quasiidentity. These two properties turn out to be equivalent.
We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton finite set act faithfully on their minimum ideals. As…
We prove that the variety V of commutative multiplicatively idempotent semirings satisfying x + y + xyz = x + y is generated by single semirings. Moreover, we describe a normal form system for terms in V and we show that the word problem in…
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…
Let $k$ be an algebraically closed field of characteristic zero, and $k[[z]]$ the ring of formal power series over $k$. We provide several characterizations of right amenable finitely generated subsemigroups of $z^2k[[z]]$ with the…
We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…
There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…
Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We identify an interesting special class of prime ideals in the finitary infinite symmetric group algebra. We show that the set of such ideals carries a semiring structure. Over the complex numbers, we establish a connection with spherical…
In this paper we characterize the existance of an ultra central approximate identity for $\ell^{1}(S)$, where $S$ is a uniformly locally finite inverse semigroup. As an application, for the Brandt semigroup $S=M^{0}(G,I)$ over a non-empty…
In this paper the concept of local embeddability into finite structures (being LEF) for the class of semigroups is expanded with investigations of non-LEF structures, a closely related generalising property of local wrapping of finite…
We give a direct construction of a specific idempotent in the endomorphism algebra of a finite lattice $T$. This idempotent is associated with all possible sublattices of $T$ which are total orders.
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinatorial invariants of seminormal monoids. We relate such numbers with the singularities and homological invariants of the semigroup ring…
A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
In this paper, we investigate semirings whose elements are either units or zero-divisors (nilpotents) with many examples. While comparing these semirings with their counterparts in ring theory, we observe that their behavior is different in…
A semi-lattice is said to be tree-like when any two of its elements are either orthogonal or comparable. Given an inverse semigroup S whose idempotent semi-lattice is tree-like, and such that all tight filters are ultra-filters, we present…