相关论文: One formation of finite groups

This paper gives a quick overview of the author's recent result that all finitely presented groups are QSF.

Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residually finite groups whose outer automorphism groups are pairwise non-isomorphic finitely generated, non-recursively-presentable groups. These…

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

After results by the author (1980, 1981), and by Vinberg (1981), finiteness of the number of maximal arithmetic reflection groups in Lobachevsky spaces was not known in dimensions $2\le n\le 9$ only. Recently (2005), the finiteness was…

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…

We describe structure of locally finite groups of finite centraliser dimension.

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

Finite $p$-groups with a unique $\mathcal{A}_2$-subgroup are classified up to isomorphism. A problem proposed by Berkovich and Janko is solved.

In response to a question raised by Belolipetsky and the first author, we prove that for every finite group $G$ there are infinitely many isomorphism classes of compact complex hyperbolic $2$-manifolds with automorphism group isomorphic to…

We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…

Compact quantum groups of face type, as introduced by Hayashi, form a class of compact quantum groupoids with a classical, finite set of objects. Using the notions of a weak multiplier bialgebra and weak multiplier Hopf algebra (resp. due…

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

We prove a characterization of monomial projective representations of finitely generated nilpotent groups. We also characterize polycyclic groups whose projective representations are finite dimensional.

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

We show that every finitely generated residually finite torsion group $G$ embeds in a finitely generated torsion group $\Gamma$ that is residually finite simple. In particular we show the existence of finitely generated infinite torsion…

In this short note, we describe the finite groups $G$ having $|G|-1$ cyclic subgroups. This leads to a nice characterization of the symmetric group $S_3$.

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…