相关论文: The loop problem for Rees matrix semigroups
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…
A \emph{loop} $(B,\cdot)$ is a set $B$ together with a binary operation $\cdot$ such that (i) for each $a\in B$, the left and right translation mappings $L_{a}:B\to B: x \mapsto a\cdot x$ and $R_{a}:B\to B: x \mapsto x\cdot a$ are…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…
For a nonempty subset $X$ of a ring $R$, the ring $R$ is called $X$-semiprime if, given $a\in R$, $aXa=0$ implies $a=0$. This provides a proper class of semiprime rings. First, we clarify the relationship between idempotent semiprime and…
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We generalize the idea of a Schur ring of a group to the category of semigroups. Fundamental results of Schur rings over groups are shown to be true for Schur rings over semigroups. Examples where Schur rings differ between the two…
It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…
A completely simple semigroup S is a semigroup without zero which has no proper ideals and contains a primitive idempotent. It is known that S is a regular semigroup and any completely simple semigroup is isomorphic to the Rees matrix…
In this paper, we investigate semirings whose elements are either units or zero-divisors (nilpotents) with many examples. While comparing these semirings with their counterparts in ring theory, we observe that their behavior is different in…
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
This is a study of universal problems for semimodules, in particular coequalizers, coproducts, and tensor products. Furthermore the structure theory of semiideals of the semiring of natural numbers is extended.
We construct loops which are semidirect products of groups of affinities. As their elements in many cases one may take transversal subspaces of an affine space. In particular we obtain in this manner smooth loops having Lie groups of affine…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Let R be a semiring. We say that a non-zero subsemimodule S of an R-semimodule M is second if for each a \in R, we have aS = S or aS = 0. The aim of this paper is to study the notion of second subsemimodules of semimodules over commutative…
The class of semi-hereditary rings is an important class of rings in theories that do not assume the Noetherian condition, such as perfectoid ring theory. We prove several results concerning the structure theory of this class, focusing on…