Related papers: Finite groups isospectral to simple groups
In this article we give an elementary introduction to the representation theory of finite magnetic groups from a purely mathematical point of view. -- En este art\'iculo damos una introducci\'on elemental a la teor\'ia de representaciones…
The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…
A subgroup $H$ of a group $G$ is said to be an $IC\Phi$-subgroup of $G$ if $H \cap [H,G] \le \Phi(H)$. We analyze the structure of a finite group $G$ under the assumption that some given subgroups of $G$ are $IC\Phi$-subgroups of $G$. A new…
For an element $x$ of a finite group $T$, the $\mathrm{Aut}(T)$-class of $x$ is the set $\{ x^\sigma\mid \sigma\in \mathrm{Aut}(T)\}$. We prove that the order $|T|$ of a finite nonabelian simple group $T$ is bounded above by a function of…
A tubular group $G$ is a finite graph of groups with $\mathbb{Z}^2$ vertex groups and $\mathbb{Z}$ edge groups. We characterize residually finite tubular groups: $G$ is residually finite if and only if its edge groups are separable. Methods…
This book is an introduction to a fast developing branch of mathematics - the theory of representations of groups. It presents classical results of this theory concerning finite groups.
In this note we study the finite groups whose subgroup lattices are dismantlable.
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
A primary covering of a finite group $G$ is a family of proper subgroups of $G$ whose union contains the set of elements of $G$ having order a prime power. We denote with $\sigma_0(G)$ the smallest size of a primary covering of $G$, and…
In this paper we study the finite groups in which every element has prime power order, briefly them EPPO-groups. The classification of EPPO-groups is given including the cases of solvable, non-solvable and simple EPPO-groups. This paper is…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
For any finite group G, there are several well-established definitions of a G-equivariant spectrum. In this paper, we develop the definition of a global orthogonal spectrum. Loosely speaking, this is a coherent choice of orthogonal…
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$.
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…
A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite…
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…
We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…