Related papers: Circuit Evaluation for Finite Semirings

We study the Finite Basis Problem for finite additively idempotent semirings whose multiplicative reducts are inverse semigroups. In particular, we show that each additively idempotent semiring whose multiplicative reduct is a nontrivial…

Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…

For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…

A finite semifield $D$ is a finite nonassociative ring with identity such that the set $D^*=D\setminus\{0\}$ is closed under the product. In this paper we obtain a computer-assisted description of all 64-element finite semifields, which…

The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial identity…

We first establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. As applications, we exhibit several examples of additively idempotent semirings satisfying this condition, including a $4$-element…

We study the finite basis problem for $4$-element additively idempotent semirings whose additive reducts have two minimal elements and one coatom. Up to isomorphism, there are $112$ such algebras. We show that $106$ of them are finitely…

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomials over rings of integers model counting problems.…

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

For every semilattice $\mathcal{A}=(A,+)$, the set $\mathrm{End}(\mathcal{A})$ of its endomorphisms forms a semiring under pointwise addition and composition. We prove that that if $\mathcal{A}$ is finite, then the endomorphism semiring…

The main scope of this paper is to introduce valuation semirings in general and discrete valuation semirings in particular. In order to do that, first we define valuation maps and investigate them. Then we define valuation semirings with…

Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We…

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

We study the finite basis problem for $4$-element additively idempotent semirings whose additive reducts are quasi-antichains. Up to isomorphism, there are $93$ such algebras. We show that with the exception of the semiring $S_{(4, 435)}$,…

We study the finite basis problem for 4-element additively idempotent semirings whose additive reducts are semilattices of height 1. Up to isomorphism, there are 58 such algebras. We show that 49 of them are finitely based and the remaining…

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…