Related papers: Circuit Evaluation for Finite Semirings

This part is a continuation of the Part I where we built resolutions of identity for certain non-Hermitian Hamiltonians constructed of biorthogonal sets of their eigen- and associated functions for the spectral problem defined on entire…

We introduce a new concept of a semiprime submodule. We show that a submodule of a finitely generated module over a commutative ring is semiprime if and only if it is radical, that is, an intersection of prime submodules. Using our notion,…

The subgroup generated by all solvable normal subgroups in a pseudo-finite group with the descending chain condition on centralizers up to finite index is solvable. Additionally, there is no finitely generated pseudo-finite group whose…

We show that the additively idempotent semiring $S_7^0$ has no finite basis for its equational theory. This answers an open problem posed by Jackson et al. (J. Algebra 611 (2022), 211--245).

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…

We investigate the notion of \textit{semi-nil clean} rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if $R$ is a semi-nil clean NI ring,…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Numerical semigroup rings are investigated from the relative viewpoint. It is known that algebraic properties such as singularities of a numerical semigroup ring are properties of a flat numerical semigroup algebra. In this paper, we show…

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

The state-of-the art proof of a global inf-sup condition on mixed finite element schemes does not allow for an analysis of truly indefinite, second-order linear elliptic PDEs. This paper, therefore, first analyses a nonconforming finite…

A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A po-semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of…

The circuit satisfaction problem CSAT(A) of an algebra A is the problem of deciding whether an equation over A (encoded by two circuits) has a solution or not. While solving systems of equations over finite algebras is either in P or…

In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…

For a subset $B$ of $\mathbb{R}$, denote by $\operatorname{U}(B)$ be the semiring of (univariate) polynomials in $\mathbb{R}[X]$ that are strictly positive on $B$. Let $\mathbb{N}[X]$ be the semiring of (univariate) polynomials with…

We establish two sufficient conditions for an additively idempotent semiring to be nonfinitely based. As applications, we prove that two specific $4$-element additively idempotent semirings, $S_{(4,545)}$ and $S_{(4,634)}$, whose additive…

We consider the cyclotomic identity testing (CIT) problem: given a polynomial $f(x_1,\ldots,x_k)$, decide whether $f(\zeta_n^{e_1},\ldots,\zeta_n^{e_k})$ is zero, where $\zeta_n = e^{2\pi i/n}$ is a primitive complex $n$-th root of unity…

We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…

Any potential application of quantum computing, once encoded as a quantum circuit, needs to be compiled in order to be executed on a quantum computer. Deciding which qubit technology, which device, which compiler, and which corresponding…

The object of this paper is to examine finite solvable groups whose integral group rings have only trivial central units.