[HTML][HTML] Every finite non-solvable group admits an oriented regular representation

J Morris, P Spiga - Journal of Combinatorial Theory, Series B, 2017 - Elsevier
Journal of Combinatorial Theory, Series B, 2017Elsevier
In this paper we give a partial answer to a 1980 question of Lazslo Babai:“Which [finite]
groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented
regular representation (ORR)? We show that every finite non-solvable group admits an
ORR, and provide a tool that may prove useful in showing that some families of finite
solvable groups admit ORRs. We also completely characterize all finite groups that can be
generated by at most three elements, according to whether or not they admit ORRs.
Abstract
In this paper we give a partial answer to a 1980 question of Lazslo Babai: “Which [finite] groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely characterize all finite groups that can be generated by at most three elements, according to whether or not they admit ORRs.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果