F. Koorepazan-Moftakhar

activity

20162020

most citedAn Algorithm for Constructing All Supercharacter Theories of a Finite Group

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

math.GR2020

Counting the Number of Centralizers of 2-Element Subsets in a Finite Group

A. R. Ashrafi, F. Koorepazan-Moftakhar, M. A. Salahshour

Suppose $G$ is a finite group. The set of all centralizers of $2 -$ element subsets of $G$ is denoted by $2 - C e n t (G)$ . A group $G$ is called $(2, n) -$ centralizer if $∣2 - C e n t (G) ∣ = n$ a…

math.GR2019★ 1 cited

An Algorithm for Constructing All Supercharacter Theories of a Finite Group

A. R. Ashrafi, L. Ghanbari Maman, K. Kavousi +1

In 2008, Diaconis annd Isaacs introduced the notion of a supercharacter theory of a finite group in which supercharacters replace with irreducible characters and superclasses by co…

math.GR2016

Towards the Classification of Finite Simple Groups with exactly Three or Four Supercharacter Theories

Ali Reza Ashrafi, Fatemeh Koorepazan-Moftakhar

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called s…