加载中…
The Rubik’s cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any -valent map. We prove an upper bound on the size of the corresponding group which we conjecture to be tight.

生成讲解博客的中文版本

生成AI智能校验的中文版本