Related papers: Power maps in finite groups

In this short note, we describe finite groups all of whose non-trivial cyclic subgroups have the same Chermak-Delgado measure.

We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…

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…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…

Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.

The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic two. Formulas are given for the length of the cycles and the depth of the trees relying…

We develop cycle index generating functions for orthogonal groups in even characteristic, and give some enumerative applications. A key step is the determination of the values of the complex linear-Weil characters of the finite symplectic…

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

We consider the structure of a finite groups having a normal series whose factors have bicyclic Sylow subgroups. In particular, we investigated groups of odd order and $A_4$-free groups with this property. Exact estimations of the derived…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order $ pqr $, where $ p,q $ and $ r $ are { primes,} are obtained. Further, the characteristic polynomials of these matrices…

Let $f(x) \in \mathbb{Z}[x]$; for each integer $\alpha$ it is interesting to consider the number of iterates $n_{\alpha}$, if possible, needed to satisfy $f^{n_{\alpha}}(\alpha) = \alpha$. The sets $\{\alpha, f(\alpha), \ldots,…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$.…

In this note we describe the finite groups $G$ having $|G|-2$ cyclic subgroups. This partially solves the open problem in the end of \cite{3}.

The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…