Related papers: The Identity Problem in virtually solvable matrix …

We obtain a sufficient condition for lattices in the automorphism group of a finite dimensional CAT(0) cube complex to have infinite girth. As a corollary, we get a version of Girth Alternative for groups acting geometrically: any such…

Finite determinacy for mappings has been classically thoroughly studied in numerous scenarios in the real- and complex-analytic category and in the differentiable case. It means that the map-germ is determined, up to a given equivalence…

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…

Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…

This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

Using graph-theoretic techniques for f.g. subgroups of $F^{\mathbb{Z}[t]}$ we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

In this paper, we provide some conditions of (super)-solvability and nilpotency of a finite group $G$ based on its number of subgroups $Sub(G)$. Our results generalize the classification of finite groups with less than $20$ subgroups by…

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

To solve two problems of Bergman stated in 1981, we construct a group $G$ such that $G$ contains a free noncyclic subgroup (hence, $G$ satisfies no group identity) and $G$, as a group, is generated by its subsemigroup that satisfies a…

The aim of this paper is to provide an atlas of identity bases for varieties generated by small semigroups and groups. To help the working mathematician easily find information, we provide a companion website that runs in the background…

We prove a Tits alternative theorem for subgroups of finitely generated even Artin groups of FC type (EAFC groups), stating that there exists a finite index subgroup such that every subgroup of it is either finitely generated abelian, or…

We consider what some authors call 'parabolic M\"obius subgroups' of matrices over Z, Q, and R and focus on the membership problem in these subgroups and complexity of relevant algorithms.

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

Let $X$ be a variety of dimension $n$, and let $\mathrm{Aut}(X)$ be its automorphism group. When $X$ is quasi-affine, we prove that a solvable subgroup of $\mathrm{Aut}(X)$ that is generated by an irreducible family of automorphisms…