Babai's problem
{{unsolved|mathematics|Which finite groups are BI-groups?}}
Babai's problem is a problem in algebraic graph theory first proposed in 1979 by László Babai.{{Citation |last1=Babai |first1=László |authorlink=László Babai|title=Spectra of Cayley graphs |journal=Journal of Combinatorial Theory, Series B |date=October 1979 |volume=27 |issue=2 |pages=180–189 |doi=10.1016/0095-8956(79)90079-0|doi-access= }}
Babai's problem
Let be a finite group, let be the set of all irreducible characters of , let be the Cayley graph (or directed Cayley graph) corresponding to a generating subset of , and let be a positive integer. Is the set
:
an invariant of the graph ? In other words, does imply that ?
BI-group
A finite group is called a BI-group (Babai Invariant group){{cite journal |last1=Abdollahi |first1=Alireza |last2=Zallaghi |first2=Maysam |title=Non-Abelian finite groups whose character sums are invariant but are not Cayley isomorphism |journal=Journal of Algebra and Its Applications |date=10 February 2019 |volume=18 |issue=1 |pages=1950013 |doi=10.1142/S0219498819500130|arxiv=1710.04446 }} if for some inverse closed subsets and of implies that for all positive integers .