Related papers: Automatic selfadjoint-ideal semigroups for finite …
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 define a class of not necessarily linear $C_0$-semigroups $(P_t)_{t\geq0}$ on $C_b(E)$ (more generally, on $C_\kappa(E):=\frac1\kappa C_b(E)$, for some bounded function $\kappa$, which is the pointwise limit of a decreasing sequence of…
Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements.…
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
We study the semigroup extension $\mathscr{I}_\lambda^n(S)$ of a semigroup $S$ by symmetric inverse semigroups of a bounded finite rank. We describe idempotents and regular elements of the semigroups $\mathscr{I}_\lambda^n(S)$ and…
We study finite semigroups of $n \times n$ matrices with rational entries. Such semigroups provide a rich generalization of transition monoids of unambiguous (and, in particular, deterministic) finite automata. In this paper we determine…
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…
We study operator semigroups in the Calkin algebra $\mathcal{Q}(\mathcal{H})$, represented as a subalgebra of the algebra of bounded linear operators on a Hilbert space via one of `canonical' Calkin's representations. Using the BDF theory,…
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,…
In this paper, we study the class of affine semigroup generated by integral vectors, whose components are in generalised arithmetic progression and we observe that the defining ideal is determinantal. We also give a sufficient condition on…
Commutative Hilbertian Frobenius algebras are those commutative semi-group objects in the monoidal category of Hilbert spaces, for which the Hilbert adjoint of the multiplication satisfies the Frobenius compatibility relation, that is, this…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator $A$, a time $t>0$, an arbitrary initial vector $u_0$ and an error tolerance…
We prove that for every semigroup of Schwarz maps on the von~Neumann algebra of all bounded linear operators on a Hilbert space which has a subinvariant faithful normal state there exists an associated semigroup of contractions on the space…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Let $X$ be a Banach space, and $T:[0,\infty)\rightarrow {\mathcal{L}}(X,X),$ the bounded linear operators on $X.$ A family $\{T(t)\}_{t\ge 0}\subseteq {% \mathcal{L}}(X,X)$ is called a one-parameter semigroup if $T(s+t)=T(s)T(t),$ and…
In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$. The vertices of this graph are the elements of $S$ and two…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…