Babai's problem

From testwiki
Jump to navigation Jump to search

Template:Unsolved 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

Template:Reflist