相关论文: Uniform independence in linear groups

Let F_n denote the free group generated by n letters. The purpose of this article is to show that Hol(F_2), the holomorph of the free group on two generators, is linear. Consequently, any split group extension of F_2 by a linear group H is…

Answering a question of Dan Haran and generalizing some results of Aschbacher-Guralnick and Suzuki, we prove that given a set of primes pi, any finite group can be generated by a pi-subgroup and a pi'-subgroup. This gives a free product…

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and…

We prove that a finitely generated group $G$ is virtually free if and only if there exists a generating set for $G$ and $k > 0$ such that all $k$-locally geodesic words with respect to that generating set are geodesic.

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

A finite group $G$ is coprimely-invariably generated if there exists a set of generators $\{g_1, \ldots, g_d\}$ of $G$ with the property that the orders $|g_1|, \ldots, |g_d|$ are pairwise coprime and that for all $x_1, \ldots, x_d \in G$…

The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.

Let $m\geq 3$ be a positive integer. We prove that there are uncountably many non-commensurable metabelian uniform pro-$p$ groups of dimension $m$. Consequently, there are uncountably many non-commensurable finitely presented pro-$p$ groups…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

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…

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…