We first provide an example of a ring R such that all possible 2 × 2 structural matrix rings over R are isomorphic. However, we prove that the underlying graphs of any two isomorphic structural matrix rings over a semiprime Noetherian ring are isomorphic, i.e. the underlying Boolean matrix B of a structural matrix ring M(B,R) over a semiprime Noetherian ring R can be recovered, contrary to the ...

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this...

We completely determine those natural numbers $n$ for which the full matrix ring $M_n(F_2)$ and triangular $T_n(F_2)$ over two elements field $F_2$ are either n-torsion clean or almost clean, respectively. These results somewhat address settle a question, recently posed by Danchev-Matczuk in Contemp. Math. (2019) as well they supply more precise aspect nil-cleanness property of $n\times n$ all ...

The purpose of this note is to compare the rings of continuous functions, integer-valued or real-valued, in pointfree topology with those in classical topology. To this end, it first characterizes the Boolean frames (= complete Boolean algebras) whose function rings are isomorphic to a classical one and then employs this to exhibit a large class of frames for which the functions rings are not o...