Related papers: Semiring identities in the semigroup $B_2$
In this note we answer the question raised by Han et al. in J. Korean Math. Soc (2014) whether an idempotent isomorphic to a semicentral idempotent is itself semicentral. We show that rings with this property are precisely the…
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…
Exactly integrable systems connected to semisimple algebras of second rank with an arbitrary choice of grading are presented in explicit form. General solutions of these systems are expressed in terms of matrix elements of two fundamental…
The concept of integral as an inverse to that of derivation was already introduced for rings and recently also for lattices. Since semirings generalize both rings and bounded distributive lattices, it is natural to investigate integration…
This note shows how iteration of the standard process of adjoining identities and zeros to semigroups gives rise naturally to the lexicographical ordering on the additive semigroup of n-tuples of nonnegative integers and n-tuples of…
Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an…
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$…
For a commutative semiring S, by an S-algebra we mean a commutative semiring A equipped with a homomorphism from S to A. We show that the subvariety of S-algebras determined by the identities 1+2x=1 and x^2=x is closed under non-empty…
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…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive…
We begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups $S$ that generate…
We study the structure of inverse primitive feebly compact semitopological and topological semigroups. We find conditions when the maximal subgroup of an inverse primitive feebly compact semitopological semigroup $S$ is a closed subset of…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
It is proved that the additive group of every semidistributive nearring $R$ with an identity is abelian and if R has no elements of order $2$, then the nearring $R$ actually is an associative ring.
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
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)…
Using the recent notion of inverse along an element in a semigroup, and the natural partial order on idempotents, we study bicommuting generalized inverses and define a new inverse called natural inverse, that generalizes the Drazin inverse…
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…