相关论文: The loop problem for Rees matrix semigroups
Let ${\cal M}(S; \Lambda; P)$ denote a Rees $I\times \Lambda$ matrix semigroup without zero over a semigroup $S$, where $I$ is a singleton. If $\theta _S$ denotes the kernel of the right regular representation of a semigroup $S$, then a…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
In this paper we study decidability and complexity of decision problems on matrices from the special linear group $\mathrm{SL}(2,\mathbb{Z})$. In particular, we study the freeness problem: given a finite set of matrices $G$ generating a…
We initiate a study of E-semigroups over convex cones. We prove a structure theorem for E-semigroups which leave the algebra of compact operators invariant. Then we study in detail the CCR flows, E$_0$semigroups constructed from isometric…
Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we…
We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
We give a constructive treatment of some basic concepts and results in semigroup theory. Focusing on semigroups equipped with an apartness relation, we give analogues, from the point of view of apartness, of several classical constructions…
The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where $A \in \Z^{m\times n}$ and ${\mathbf b} \in \Z^m$, finds its applications in many areas,…
We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…
We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…
In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…
In a previous paper [1] [MR4101040], we initiated a systematic study of semihypergroups and had a thorough discussion about some important analytic and algebraic objects associated to this class of objects. In this paper, we investigate…
Fix a finite semigroup $S$ and let $a_1, \ldots, a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1, \ldots, a_k$. For combinatorial Rees matrix semigroups we…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…