Related papers: Power maps in finite groups

We prove a characterization of monomial projective representations of finitely generated nilpotent groups. We also characterize polycyclic groups whose projective representations are finite dimensional.

The notion of formal duality in finite Abelian groups appeared recently in relation to spherical designs, tight sphere packings, and energy minimizing configurations in Euclidean spaces. For finite cyclic groups it is conjectured that there…

Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

In this paper it is shown that every finite cyclic group satisfies the CI-property for the class of balanced configurations.

In this paper we have investigated some properties of the power graph and commuting graph associated with a finite group, using their tree-numbers. Among other things, it has been shown that the simple group $L_2(7)$ can be characterized…

We study finite capable $p$-groups $G$ of nilpotency class 2 such that the commutator subgroup $\gamma_2(G)$ of $G$ is cyclic and the center of $G$ is contained in the Frattini subgroup of $G$.

We study the number of cylic subgroups in finite groups and get that $G$ has $|G|-3$ cyclic subgroups if and only if $G \cong D_{10}$ or $Q_8$.

A finite group $G$, its group algebra $R[G]$ over the field of real numbers, any power series $p(t)= a_0+a_1t+ a_{2}t^{2}+ ...$, where $ a_i \geq 0$, and $a_0+a_1+ a_{2}+...= 1$, and simplex $$ S= \{x=\sum_{g\in G}x_gg\in R[G]: \sum_{g\in…

T\u{a}rn\u{a}uceanu described the finite groups $G$ having exactly $|G|-1$ cyclic subgroups. In "Finite Groups with a Prescribed Number of Cyclic Subgroups,", we used elementary methods to completely characterize those finite groups $G$…

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…

We derive several existence results concerning cycle types and, more generally, the "mapping behavior" of complete mappings. Our focus is on so-called first-order cyclotomic mappings, which are functions on a finite field $\mathbb{F}_q$…

The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…