Related papers: Mixability of finite groups
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
A combinatorial group-theoretic hypothesis is presented that serves as a necessary and sufficient condition for a union of connected Cockcroft two-complexes to be Cockcroft. This hypothesis has a component that can be expressed in terms of…
Some new results on metric ultraproducts of finite simple groups are presented. Suppose that G is such a group, defined in terms of a non-principal ultrafilter {\omega} on N and a sequence {(G_i)_{i \in N}} of finite simple groups, and that…
This paper is an attempt to find out which properties of a finite group G can be expressed in terms of commutators of elements of coprime orders. A criterion of solubility of G in terms of such commutators is obtained. We also conjecture…
Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.
A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…
We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that with the only specific exception the solvable radical of a nonsolvable finite group…
We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…
A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…
For a group G we consider the set of natural numbers n for which the nth cohomology functor of G commutes with filtered colimit systems of coefficient modules. We find that for the large class of hierarchically decomposable groups there is…
The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…
For nonstationary, strongly mixing sequences of random variables taking their values in a finite-dimensional Euclidean space, with the partial sums being normalized via matrix multiplication, with certain standard conditions being met, the…