Related papers: Solution of the word problem for semigroups withou…

We show that in a Morse local-to-global group where stable subgroups are separable, the product of any stable subgroups is separable. As an application, we show that the product of stable subgroups in virtually special groups is separable.

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…

In this paper we establish existence of a solution to a semilinear equation with free boundary conditions on stratified Lie groups. In the process, a monotonicity condition is proved, which is quintessential in establishing the regularity…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…

We first prove that the Whitehead group of a torsion-free virtually solvable linear group vanishes. Next we make a reduction of the fibered isomorphism conjecture from virtually solvable groups to a class of virtually solvable Q-linear…

We position Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain kind must solve the halting problem for all programs of that…

We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.

We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

We prove the decidability of the elementary theory of a free group.

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

In this paper we extend the results on controllability of linear systems obtained in "Controllability of linear systems on solvable Lie groups", from solvable Lie groups to Lie groups with finite semisimple center.

We prove a structure theorem for periodic locally soluble groups satisfying a chain condition on intersections of relatively uniformly definable subgroups using results from the theory of stable groups. The result in particular shows that…

The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are…

The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…