A Combinatorial Problem from Group Theory
Combinatorics
2017-01-31 v1 Group Theory
Abstract
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that conjecture is true in the general case. We also propose a combinatorial game version of the conjecture which even further generalizes the problem.
Cite
@article{arxiv.1701.08480,
title = {A Combinatorial Problem from Group Theory},
author = {Eugene Curtin and Suho Oh},
journal= {arXiv preprint arXiv:1701.08480},
year = {2017}
}
Comments
6 pages