DeepAI AI Chat
Log In Sign Up

On the functional graph of the power map over finite groups

by   Claudio Qureshi, et al.

In this paper we study the description of the digraph associated with the power map over finite groups. Our main motivation comes from the nice description of such digraphs in the case of cyclic groups. In particular, we derive results on abelian groups, and also on flower groups, which are introduced in this paper. The class of flower groups includes many non abelian groups such as dihedral and generalized quaternion groups, and the projective general linear group of order two over a finite field. In particular, we provide improvements on past works.


page 1

page 2

page 3

page 4


Recognizing the Commuting Graph of a Finite Group

In this paper we study the realizability question for commuting graphs o...

Complexity of Conjugacy Search in some Polycyclic and Matrix Groups

The most prominent algorithmic problem employed in the recently emerging...

Python Implementation and Construction of Finite Abelian Groups

Here we present a working framework to establish finite abelian groups i...

On the Descriptive Complexity of Groups without Abelian Normal Subgroups

In this paper, we explore the descriptive complexity theory of finite gr...

The Todd-Coxeter Algorithm for Semigroups and Monoids

In this paper we provide an account of the Todd-Coxeter algorithm for co...

Cooperation in Small Groups – an Optimal Transport Approach

If agents cooperate only within small groups of some bounded sizes, is t...

A Closer Look at the Multilinear Cryptography using Nilpotent Groups

In a previous paper we generalized the definition of a multilinear map t...