Babai's problem

From HandWiki
Unsolved problem in mathematics:
Which finite groups are BI-groups?
(more unsolved problems in mathematics)

Babai's problem is a problem in algebraic graph theory first proposed in 1979 by László Babai.[1]

Babai's problem

Let G be a finite group, let Irr⁡(G) be the set of all irreducible characters of G, let Γ=Cay⁡(G,S) be the Cayley graph (or directed Cayley graph) corresponding to a generating subset S of G∖{1}, and let ν be a positive integer. Is the set

MνS={∑s∈Sχ(s)|χ∈Irr⁡(G),χ(1)=ν}

an invariant of the graph Γ? In other words, does Cay⁡(G,S)≅Cay⁡(G,S′) imply that MνS=MνS′?

BI-group

A finite group G is called a BI-group (Babai Invariant group)[2] if Cay⁡(G,S)≅Cay⁡(G,T) for some inverse closed subsets S and T of G∖{1} implies that MνS=MνT for all positive integers ν.

Open problem

Which finite groups are BI-groups?[3]

See also

References

  1. ↑ Babai, László (October 1979), "Spectra of Cayley graphs", Journal of Combinatorial Theory, Series B 27 (2): 180–189, doi:10.1016/0095-8956(79)90079-0 
  2. ↑ Abdollahi, Alireza; Zallaghi, Maysam (10 February 2019). "Non-Abelian finite groups whose character sums are invariant but are not Cayley isomorphism". Journal of Algebra and Its Applications 18 (01): 1950013. doi:10.1142/S0219498819500130. 
  3. ↑ Abdollahi, Alireza; Zallaghi, Maysam (24 August 2015). "Character Sums for Cayley Graphs". Communications in Algebra 43 (12): 5159–5167. doi:10.1080/00927872.2014.967398.