Babai's problem
Jump to navigation
Jump to search
Unsolved problem in 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.[1]
Babai's problem
[edit | edit source]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
[edit | edit source]A finite group is called a BI-group (Babai Invariant group)[2] if for some inverse closed subsets and of implies that for all positive integers .
Open problem
[edit | edit source]Which finite groups are BI-groups?[3]
See also
[edit | edit source]References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).