A number is perfect if it is the sum of its proper divisors; here we call a finite group `perfect' if its order is the sum of the orders of its proper normal subgroups. (This conflicts with standard terminology but confusion should not arise.) The notion of perfect group generalizes that of perfect number, since a cyclic group is perfect exactly when its order is perfect. We show that, in fact, the only abelian perfect groups are the cyclic ones, and exhibit some non-abelian perfect groups of even order.
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with perfect order classes. We show that a finite Hamiltonian group has perfect order classes if, and only if, it is isomorphic to the direct product of the quaternion group of order $8$, a non-trivial cyclic $3$-group and a group of order at most $2$. Theorem. A finite Hamiltonian group has perfect order classes if, and only if, it is isomorphic either to $Q\ti…
We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated by a couple of examples that might be of independent interest.
We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable groups, illustrating scope and feasibility of the enumeration process for nonsolvable groups.
We study cyclically presented groups of type $\mathfrak{F}$ to determine when they are perfect. It turns out that to do so, it is enough to consider the Prishchepov groups, so modulo a certain conjecture, we classify the perfect Prishchepov groups $P(r,n,k,s,q)$ in terms of the defining integer parameters $r,n,k,s,q$. In particular, we obtain a classification of the perfect Campbell and Robertson's Fibonacci-type groups $H(r,n,s)$, thereby proving a conjecture of Williams, and yielding a complete classification of the groups $H(r,n,s)$ that are connected Labelled Oriented Graph groups.
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for particular words and groups, give a brief survey of recent results, present some generalizations and variations and discuss various approaches, with emphasis on new ideas, constructions and connections.
A finite group G is said to be a POS-group if the number of elements of every order occurring in G divides |G|. We answer two questions by Finch and Jones by providing an infinite family of nonabelian POS-groups with orders not divisible by 3.
We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.
Let G be an isotropic reductive algebraic group over a commutative ring R. Assume that the elementary subgroup E(R) of group of points G(R) is correctly defined. Then E(R) is perfect, except for the well-known cases of a split reductive group of type C_2 or G_2.
T. De Medts, Y. Segev and K. Tent [Special Moufang sets, their root groups and their μ-maps, Proc. Lond. Math. Soc. (3) 96 (2008), 767-791] proved that the little projective group of a special Moufang set M(U,τ) is perfect provided that U has size at least 4. We give a short, elementary and self-contained argument, working with Timmesfeld's concept of special (abstract) rank one groups with arbitrary unipotent subgroups [Abstract root subgroups and simple groups of Lie type, Monographs in Mathematics, 95. Birkhäuser, 2001].
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of $G$. The proof requires a combinatorial lemma. We give some remarks about related graphs.
On the Classification of Perfect Prishchepov Groups
Department of Pure Mathematics, University of Khartoum and Al Neelain University, Khartoum, Sudan（喀土穆苏丹喀土穆大学纯数学系和阿尔内拉因大学）；Department of Mathematics and Applied Mathematics, University of Pretoria, Hatfield 0028, Pretoria, South Africa（南非比勒陀利亚哈菲尔德0028比勒陀利亚大学应用数学与数学系）
Let $G$ be a finite group with a Sylow $p$-subgroup $P$. We prove that the principal $p$-blocks of $G$ and $N_G(P)$ are perfectly isometric under the assumption $G$ has a cyclic $p$-hyperfocal subgroup.
T. De Medts, Y. Segev and K. Tent [Special Moufang sets, their root groups and their μ-maps, Proc. Lond. Math. Soc. (3) 96 (2008), 767-791] proved that the little projective group of a special Moufang set M(U,τ) is perfect provided that U has size at least 4. We give a short, elementary and self-contained argument when U is abelian, working with Timmesfeld's concept of special (abstract) rank one groups with abelian unipotent subgroups [Abstract root subgroups and simple groups of Lie type, Monographs in Mathematics, 95. Birkhäuser, 2001]. This simplifies Timmesfeld's (quasi) simplicity criter…
Backtrack search is a fundamental technique for computing with finite permutation groups, which has been formulated in terms of points, ordered partitions, and graphs. We provide a framework for discussing the most common forms of backtrack search in a generic way. We introduce the concept of perfect refiners to better understand and compare the pruning power available in these different settings. We also present a new formulation of backtrack search, which allows the use of graphs with additional vertices, and which is implemented in the software package Vole. For each setting, we classify th…
Let $F$ be a perfect field and $M^*(F)$ the nonassociative simple Moufang loop consisting of the units in the (unique) split octonion algebra $O(F)$ modulo the center. Then $Aut(M^*(F))$ is equal to $G_2(F) \rtimes Aut(F)$. In particular, every automorphism of $M^*(F)$ is induced by a semilinear automorphism of $O(F)$. The proof combines results and methods from geometrical loop theory, groups of Lie type and composition algebras; its gist being an identification of the automorphism group of a Moufang loop with a subgroup of the automorphism group of the associated group with triality.
If $G$ is a finite group and $x\in G$ then the set of all elements of $G$ having the same order as $x$ is called {\em an order subset of $G$ determined by $x$} (see [2]). We say that $G$ is a {\em group with perfect order subsets} or briefly, $G$ is a {\em $POS$-group} if the number of elements in each order subset of $G$ is a divisor of $|G|$. In this paper we prove that for any $n\geq 4$, the symmetric group $S_n$ is not $POS$-group. This gives the positive answer to one of two questions rising from Conjecture 5.2 in [3].
We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with the above property. Furthermore, we give some structural information in the infinite perfect case.
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the quasiparabolic centralizers of perfect involutions. In prior work, we showed that perfect models give rise to interesting examples of $W$-graphs. Here, we classify which finite Coxeter groups have perfect models. Specifically, we prove that the irreducible finite Coxeter groups with perfect models are those of types $\mathsf{A}_{n}$, $\mathsf{B}_n$, $\mathsf{D}_…
In this paper, we consider the problem on the existence of perfect state transfer(PST for short) on semi-Cayley graphs over abelian groups (which are not necessarily regular), i.e on the graphs having semiregular and abelian subgroups of automorphisms with two orbits of equal size. We stablish a characterization of semi-Cayley graphs over abelian groups having PST. As a result, we give a characterization of Cayley graphs over groups with an abelian subgroup of index 2 having PST, which improves the earlier results on Cayley graphs over abelian groups, dihedral groups and dicyclic group and det…
It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert series identity to these and other closely related groups.
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for amenable groups: if there is a perfect matching on the graph, there is also a perfect matching on the factor graph, i. e. a group invariant ("symmetric") perfect matching on the graph.
Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an integer q, denote by Ga_q the subgroup of Ga consisting of the elements that project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q with respect to the generating set S form a family of expanders when q ranges over square-free integers with large prime divisors if and only if the connected component of the Zariski-closure of Ga is perfect.
In this paper we answer negatively a question posed by Casacuberta, Farjoun, and Libman about the preservation of perfect groups under localization functors. Indeed, we show that a certain $P$-localization of Berrick and Casacuberta's universal acyclic group is not perfect. We also investigate under which conditions perfectness is preserved: For instance, we show that if the localization of a perfect group is finite then it is perfect.
This article is concerned with perfect isometries between blocks of finite groups. Generalizing a method of Enguehard to show that any two p-blocks of (possibly different) symmetric groups with the same weight are perfectly isometric, we prove analogues of this result for p-blocks of alternating groups (where the blocks must also have the same sign when p is odd), of double covers of alternating and symmetric groups (for p odd, and where we obtain crossover isometries when the blocks have opposite signs),of complex reflection groups G(d,1,n) (for d prime to p), of Weyl groups of type B and D (…
We show that the closure of the compactly supported mapping class group of an infinite type surface is not perfect and that its abelianization contains a direct summand isomorphic to an uncountable direct sum of rationals. We also extend this to the Torelli group and show that in the case of surfaces with infinite genus the abelianization of the Torelli group contains an indivisible copy of an uncountable free abelian group as well. Finally we give an application to the question of automatic continuity by exhibiting discontinuous homomorphisms to the rationals.
We show that the finitely generated simple left orderable groups $G_ρ$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of elements in the group. This implies that the group does not admit any homogeneous quasimorphism. Moreover, any nontrivial action of the group on the circle, which lifts to an action on the real line, admits a fixed point. Most strikingly, it follows that the groups are examples of left orderable monsters, which means that any faithful action on the real line without…
A perfect code $C$ in a graph $Γ$ is an independent set of vertices of $Γ$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $Γ$ is a set of vertices of $Γ$ such that every vertex of $Γ$ is adjacent to a unique vertex in $C$. Let $G$ be a finite group and $X$ a normal subset of $G$. The Cayley sum graph $\mathrm{CS}(G,X)$ of $G$ with the connection set $X$ is the graph with vertex set $G$ and two vertices $g$ and $h$ being adjacent if and only if $gh\in X$ and $g\neq h$. In this paper, we give some necessary conditions of a subgroup of…
We establish, generalizing Di Nola and Lettieri's categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classifying topos, three levels of bi-intepretability holding for particular classes of formulas: irreducible formulas, geometric sentences and imaginaries. Lastly, by investigating the classifying topos of the theory of perfect MV-algebra…
Perfect colourings of the rings of cyclotomic integers with class number one are studied. It is shown that all colourings induced by ideals (q) are chirally perfect, and vice versa. A necessary and sufficient condition for a colouring to be perfect is obtained, depending on the factorisation of q. This result yields the colour symmetry group H in general. Furthermore, the colour preserving group K is determined in all but finitely many cases. An application to colourings of quasicrystals is given.
Characterizing Finite Groups via Subgroup Perfect Codes
School of Mathematics & Guangxi University（广西大学数学学院）；Guangxi University（广西大学）；School of Mathematics and Computing Science, Guilin University of Electronic Technology（桂林电子科技大学数学与计算科学学院）；Guilin University of Electronic Technology（桂林电子科技大学）
