Related papers: The additively idempotent semiring $S_7^0$ is nonf…
The authors [3] proved that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and described its monolith. Here we prove that the endomorphism semiring of a commutative inverse semigroup with at least…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
We prove that supernilpotent and nilpotent semirings with absorbing zero are the same and provide a necessary and sufficient condition for supernilpotency (nilpotency).
The paper develops further the theory of quandle rings which was introduced by the authors in a recent work. Orderability of quandles is defined and many interesting examples of orderable quandles are given. It is proved that quandle rings…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to show that the 9-element monoid $L_4^1$ is non-finitely based. The monoid $L_4^1$ was the only unsolved case in the finite basis…
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…
We extend the notion of semi-infinite cohomology of Lie algebras to include cases where the Lie algebra does not admit a semi-infinite structure but satisfies a mild condition. Our construction clarifies the definition of affine W-algebras…
This paper establishes the existence of a finitely based finite semiring whose variety contains a continuum of subvarieties; such a variety is said to be of type \(2^{\aleph_0}\). Using the homomorphism theory of Kneser graphs, we prove…
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
The resultant plays a crucial role in (computational) algebra and algebraic geometry. One of the most important and well known properties of the resultant is that it is equal to the determinant of the Sylvester matrix. In 2008, Odagiri…
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…
In recent years, the finite W-algebras associated to a semisimple Lie algebra and its nilpotent element have been studied intensively from different viewpoints. In this lecture series, we shall present some basic constructions, connections,…
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…
It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
Let $R$ be a commutative additively idempotent semiring. In this paper, some properties and characterizations for permanents of matrices over $R$ are established, and several inequalities for permanents are given. Also, the adjiont matrices…
The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…
We prove an algebraic ``no-go theorem'' to the effect that a nontrivial Poisson algebra cannot be realized as an associative algebra with the commutator bracket. Using this, we show that there is an obstruction to quantizing the Poisson…
We provide a classification of congruence-simple semirings with a multiplicatively absorbing element and without non-trivial nilpotent elements.
Exponential Puiseux semirings are additive submonoids of $\qq_{\geq 0}$ generated by almost all of the nonnegative powers of a positive rational number, and they are natural generalizations of rational cyclic semirings. In this paper, we…