◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

G. R. Pourgholi

4 papers hereh-index 5107 citations10 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • last author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.GR2
  • math.NT2

identity via Semantic Scholar / OpenAlex

most citedEdge-maximality of power graphs of finite cyclic groups

40 citations · 43 across the 4 of their papers we have counts for

collaborators

4 papers

math.NT2015

On the Lehmer Numbers, II

Gholam Reza Pourgholi, Hendrik Van Maldeghem

A composite number n is called a Lehmer number when ϕ(n)∣n−1, where ϕ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n…

math.NT2015

On The Lehmer Numbers, I

Gholam Reza Pourgholi

A composite number n is called Lehmer when ϕ(n)∣n−1, where ϕ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers a…

math.GR2013★ 40 cited

Edge-maximality of power graphs of finite cyclic groups

Brian Curtin, Gholam Reza Pourgholi

We show that among all finite groups of any given order, the cyclic group of that order has the maximum number of edges in its power graph. Contains corrections to published versio…

math.GR2013★ 3 cited

A group sum inequality and its application to power graphs

Brian Curtin, Gholam Reza Pourgholi

Let G be a finite group of order n, and let Cn​ be the cyclic group of order n. We show that ∑g∈Cn​​ϕ(o(g))≥∑g∈G​ϕ(o(g)), with e…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.