A group sum inequality and its application to power graphs

Authors

  • B. Curtin University of South Florida
  • G. R. Pourgholi University of Tehran

Keywords:

Cyclic groups, Euler totient, Sylow subgroups

Abstract

Let \(G\) be a finite group of order \(n\), and let \(C_n\) be the cyclic group of order \(n\). For \(g∈G\), let \(o(g)\) denote the order of \(g\). Let \(ϕ\) denote the Euler totient function. We show that \(\sum_{g \in C_n} \phi(o(g))\geq \sum_{g \in G} \phi(o(g))\), with equality if and only if \(G\) is isomorphic to \(C_n\). As an application, we show that among all finite groups of a given order, the cyclic group of that order has the maximum number of undirected edges in its directed power graph. DOI:- 10.1017/S0004972714000434

Author Biographies

B. Curtin, University of South Florida

Department of Mathematics and Statistics University of South Florida Associate Professor

G. R. Pourgholi, University of Tehran

School of Mathematics, Statistics and Computer Science University of Tehran Graduate Student

Published

2014-09-20

Issue

Section

Articles