A combinatorial problem from group theory

MaRDI QIDQ5206930zbMATH OpenFDO

Authors Eugene Curtin, Suho Oh

Publication date 19 December 2019

Full work available at URL https://arxiv.org/abs/1701.08480, http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p309.pdf

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)

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.

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

Cites work

• A combinatorial problem arising in group theory

Cited in

(4)

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

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)