A combinatorial problem from group theory

zbMATH Open1429.05204arXiv1701.08480MaRDI QIDQ5206930FDOQ5206930

Authors: Eugene Curtin, Suho Oh 

Publication date: 19 December 2019

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.

Full work available at URL: https://arxiv.org/abs/1701.08480

Recommendations

• scientific article; zbMATH DE number 566007
• Keller's conjecture for certain p-groups
• Keller's conjecture for certain finite groups
• A combinatorial problem arising in group theory
• On the algebraic form of Keller's conjecture

zbMATH Keywords

finite groupssolvable groupsirreducible characters

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• A combinatorial problem arising in group theory

Cited In (4)

• A combinatorial problem in infinite groups.
• An Introduction to Combinatorial Group Theory and the Word Problem
• Two Combinatorial Problems in Group Theory
• A combinatorial problem arising in group theory

This page was built for publication: A combinatorial problem from group theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206930)