Association schemes based on isotropic subspaces, Part 1
Association schemes based on isotropic subspaces, Part 1
复制标题
DOI：
10.1016/j.disc.2004.02.021
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
M. Rieck
中科院分区：
文献类型：
--
作者：
M. Rieck
有限经典极空间中给定维数的子空间形成结合概型的点。当维数为零时，这是空间的共线图的图式。在另一个极端，当维数最大时，它是相应的对偶极图的方案。这些极端的案例已经被彻底研究过了。在这篇文章中，一般情况下进行检查，并开始详细计算这些关联方案的交集数。
The subspaces of a given dimension in a finite classical polar space form the points of an association scheme. When the dimension is zero, this is the scheme of the collinearity graph of the space. At the other extreme, when the dimension is maximal, it is the scheme of the corresponding dual polar graph. These extreme cases have been thoroughly studied. In this article, the general case is examined and a detailed computation of the intersection numbers of these association schemes is initiated.