相关论文: Finitely generated groups with polynomial index gr…

It is known that a finite group with an automorphism $\varphi$ of coprime order has a soluble radical of $(|\varphi|,|C_G(\varphi)|)$-bounded Fitting height and index. We extend this classic result as follows. Let $f(x) = a_0 + a_1 \cdot x…

We prove that irreducible complex representations of finitely generated nilpotent groups are monomial if and only if they have finite weight, which was conjectured by Parshin. Note that we consider (possibly, infinite-dimensional)…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

A group $G$ is called residually finite if for every non-trivial element $g \in G$, there exists a finite quotient $Q$ of $G$ such that the element $g$ is non-trivial in the quotient as well. Instead of just investigating whether a group…

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

A profinite group $G$ is just infinite if every closed normal subgroup of $G$ is of finite index. We prove that an infinite profinite group is just infinite if and only if, for every open subgroup $H$ of $G$, there are only finitely many…

We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…

For a finite group $G$ we investigate the difference between the maximum size MaxDim$(G)$ of an "independent" family of maximal subgroups of $G$ and maximum size $m(G)$ of an irredundant sequence of generators of $G$. We prove that…

Bumagin-Wise posed the question of whether every countable group can be realised as the outer automorphism group of a finitely generated, residually finite group. We give a partial answer to this problem for recursively presentable groups.

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A finitely generated solvable group with unbounded iterated identity is constructed.

We prove that for a finitely generated linear group G over a field of positive characteristic the family of quotients by finite subgroups has finite asymptotic dimension. We use this to show that the K-theoretic assembly map for the family…

We prove that, in a finitely generated residually finite group of subexponential growth, the proportion of commuting pairs is positive if and only if the group is virtually abelian. In particular, this covers the case where the group has…

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

Let $A$ be an Artin group. A partition $\mathcal{P}$ of the set of standard generators of $A$ is called admissible if, for all $X,Y \in \mathcal{P}$, $X \neq Y$, there is at most one pair $(s,t) \in X \times Y$ which has a relation. An…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…