Related papers: Perfect Prishchepov groups

A subset \( C \) of the vertex set \( V \) of a graph \( \Gamma = (V,E) \) is termed an $(r,s)$-regular set if each vertex in \( C \) is adjacent to exactly \( r \) other vertices in \( C \), while each vertex not in \( C \) is adjacent to…

We consider the Brauer group ${\rm BM}'(k,G)$ of a group $G$ (finite or infinite) over a commutative ring $k$ with identity. A split exact sequence $$1\longrightarrow {\rm Br}'(k)\longrightarrow {\rm BM}'(k,G)\longrightarrow {\rm Gal}(k,G)…

By definition, a group $G$ is quasi-perfect, if $G$ is perfect or the commutator subgroup of $G$ is perfect. In this note we give a description of quasi-perfect Dyer groups by properties of the corresponding Dyer graphs.

Given pointed $CW$-complexes $X$ and $Y$, $\rmph(X, Y)$ denotes the set of homotopy classes of phantom maps from $X$ to $Y$ and $\rmsph(X, Y)$ denotes the subset of $\rmph(X, Y)$ consisting of homotopy classes of special phantom maps. In a…

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…

T. De Medts, Y. Segev and K. Tent [Special Moufang sets, their root groups and their \mu-maps, Proc. Lond. Math. Soc. (3) 96 (2008), 767-791] proved that the little projective group of a special Moufang set M(U,\tau) is perfect provided…

For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

Extending the notion of (random) $k$-out graphs, we consider when the $k$-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each $r$ there is a $k=k(r)$ such that the $k$-out $r$-uniform…

Let $k$ be a perfect field of characteristic $p \geq 3$. We classify $p$-divisible groups over regular local rings of the form $W(k)[[t_1,...,t_r,u]]/(u^e+pb_{e-1}u^{e-1}+...+pb_1u+pb_0)$, where $b_0,...,b_{e-1}\in W(k)[[t_1,...,t_r]]$ and…

A subset $C$ of the vertex set $V$ of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. Given a group $G$ and a subgroup $H$ of $G$, a subgroup $A$ of $G$…

Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson,…

Let $\Gamma$ be a graph with vertex set $V(\Gamma)$. A subset $C$ of $V(\Gamma)$ is called a perfect code in $\Gamma$ if $C$ is an independent set of $\Gamma$ and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in…

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

Let $G$ be a connnected, unipotent, perfect group scheme over an algebraically closed field of characteristic p > 0. V. Drinfeld has defined a certain metric group associated to biextensions of $G \times G$ by the discrete group $Q_p/Z_p$.…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

For positive integers $k$ and $n$, the shuffle group $G_{k,kn}$ is generated by the $k!$ permutations of a deck of $kn$ cards performed by cutting the deck into $k$ piles with $n$ cards in each pile, and then perfectly interleaving these…

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…