Related papers: Is decidability of the Submonoid Membership Proble…

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Suppose $G$ is a finitely presented group that is hyperbolic relative to ${\bf P}$ a finite collection of 1-ended finitely generated proper subgroups of $G$. If $G$ and the ${\bf P}$ are 1-ended and the boundary $\partial (G,{\bf P})$ has…

We first give complete characterizations of the structure of finite group $G$ in which every subgroup (or non-nilpotent subgroup, or non-abelian subgroup) is a TI-subgroup or subnormal or has $p'$-order for a fixed prime divisor $p$ of…

We give an answer to the abstract Capelli problem: Let $(G, V)$ be a multiplicity-free finite-dimensional representation of a connected reductive complex Lie group $G$ and $G'$ be its derived subgroup. Assume that the categorical quotient…

Let $G$ be a finite soluble group and $G^{(k)}$ the $k$th term of the derived series of $G$. We prove that $G^{(k)}$ is nilpotent if and only if $|ab|=|a||b|$ for any $\delta_k$-values $a,b\in G$ of coprime orders. In the course of the…

We show that the subset sum problem, the knapsack problem and the rational subset membership problem for permutation groups are NP-complete. Concerning the knapsack problem we obtain NP-completeness for every fixed $n \geq 3$, where $n$ is…

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

The main result of this paper shows that if $\mathcal{M}$ is a consistent strong linear Maltsev condition which does not imply the existence of a cube term, then for any finite algebra $\mathbb{A}$ there exists a new finite algebra…

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…

Let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. We prove that if $G$ is a finitely generated group in which the set of all simple tensors $T_{\otimes}(G)$ is…

Let $k$ be a nonperfect separably closed field. Let $G$ be a connected reductive algebraic group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In particular, we present the…

In this work we show that the homogeneous space of an affine algebraic group $G$ by a one-dimensional unipotent subgroup $H$ is affine if and only if the subgroup is not contained in any reductive subgroup of $G$.

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

Suppose $G$ is a 1-ended finitely generated group that is hyperbolic relative to P a finite collection of 1-ended finitely generated subgroups. Our main theorem states that if the boundary $\partial (G, P)$ has no cut point, then $G$ has…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain…

Let $G$ be a dp-minimal group; we prove some consequences of several different hypotheses on $G$. First, if $G$ is torsion-free, then it is abelian. Second, if $G$ admits a distal f-generic type, then it is virtually nilpotent; we prove…