arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.10726math.GRmath.CO
收藏

对角群的几何

The geometry of diagonal groups

R. A. Bailey, Peter J. Cameron, Cheryl E. Praeger, Csaba Schneider

摘要:

对角群是在O 'Nan-Scott定理的结论中出现的有限本原置换群的一类。其他几个类已经被描述为几何或组合结构的自同构群,如仿射空间或笛卡尔分解,但对角群的这种结构还没有被研究。本文的主要目的是描述和描述这样的结构,我们称之为对角半格。与O 'Nan-Scott定理中定义在有限特征单群上的对角群不同,我们的构造适用于任何群,有限或无限。对角半格取决于维度m和群T。当m=2时,它是一个拉丁方,即T的凯莱表,尽管事实上任何拉丁方都满足我们的公理。然而,当m>=3时,群T从公理中自然且唯一地出现。(The这种情况有点类似于射影几何,其中射影平面大量存在,但高维结构由代数对象(除环)协调。)一个对角半格包含在集合上的分划格中,我们提供了一个介绍分划演算。许多概念和结构来自统计学中的试验设计。我们还确定对角群何时可以是本原的或准本原的(这些条件对于对角群是等效的)。与对角半格相关联的是一个图,对角图,它具有相同的自同构群,除了在四个小的情况下,m<=3。对角图类包括一些著名的图族,拉丁方图和折叠立方体。我们得到了对角图的色数的部分结果,并提到了同步的应用。

英文摘要:

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over any group, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our axioms. However, for m>=3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions are equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group except in four small cases with m<=3. The class of diagonal graphs includes some well-known families, Latin-square graphs and folded cubes. We obtain partial results on the chromatic number of a diagonal graph, and mention an application to synchronization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑