Related papers: Power maps in finite groups

We exhibit finite cyclic group representations for relation algebras $57_{65}$ and $63_{65}$. As a consequence, of the ten symmetric integral RAs on four atoms having at least one flexible atom, all are now known to have a representation…

Aiming at a better understanding of finite groups as finite dynamical systems, we show that by a version of Fitting's Lemma for groups, each state space of an endomorphism of a finite group is a graph tensor product of a finite directed…

We study groups having the property that every non-cyclic subgroup contains its centralizer. The structure of nilpotent and supersolvable groups in this class is described. We also classify finite $p$-groups and finite simple groups with…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…

We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

The enhanced power graph of a group is the simple graph whose vertex set is consisted of all elements of the group, and whose any pair of vertices are adjacent if they generate a cyclic subgroup. In this paper, we classify all finite groups…

In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized…

This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

We prove the following: For any $\rho\in\left(0,1\right)$, if a finite group $G$ has an automorphism with a cycle of length at least $\rho\cdot|G|$, then the index of the solvable radical $\operatorname{Rad}(G)$ in $G$ is bounded from above…

In this paper we study planar polynomial Kolmogorov's differential systems \[ X_\mu\quad\sist{xf(x,y;\mu),}{yg(x,y;\mu),} \] with the parameter $\mu$ varying in an open subset $\Lambda\subset\R^N$. Compactifying $X_\mu$ to the Poincar\'e…

We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…

The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…