Related papers: Circuit Evaluation for Finite Semirings
For a cancellative semigroup S and a field F, it is proved that the semigroup algebra FS is centrally essential if and only if the group of fractions $G_S$ of the semigroup $S$ exists and the group algebra $FG_S$ of $G_S$ is centrally…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
This is a write-up of the discussions during the meetings of the study group on representation theory of semirings which was organized at the Department of Mathematics, Uppsala University, during the academic year 2017-2018. The main…
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)…
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the…
We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…
Let $D$ be a division ring with center $F$. We say that $D$ is a {\em division ring of type $2$} if for every two elements $x, y\in D,$ the division subring $F(x, y)$ is a finite dimensional vector space over $F$. In this paper we…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.
We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.
We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big…
Fixing an arbitrary set $\mathcal{F}$ of complex-valued functions over Boolean variables yields a counting problem $\#\mathcal{F}$. Taking only functions from $\mathcal{F}$ to form a tensor network as the problem's input, the counting…
We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
Let (R, m) be the semigroup ring associated to a numerical semigroup S. In this paper we study the property of its associated graded ring G(m) to be Complete Intersection. In particular, we introduce and characterise beta-rectangular and…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
In this paper, we introduce and study V- and CI-semirings---semirings all of whose simple and cyclic, respectively, semimodules are injective. We describe V-semirings for some classes of semirings and establish some fundamental properties…