首页> 外文期刊>Journal of Combinatorial Theory, Series A >On maximal closed subsets in association schemes
【24h】

On maximal closed subsets in association schemes

机译:关于关联方案中的最大封闭子集

获取原文
获取原文并翻译 | 示例
       

摘要

We offer a sufficient condition for a closed subset in an association scheme to be maximal. The result generalizes naturally the well-known (group-theoretical) fact that the one-point-stabilizer of a flag transitive automorphism group of a 2-design with lambda = 1 must be a maximal subgroup. In finite group theory, there exist a lot of (important) sufficient conditions for a subgroup to be maximal. In the theory of association schemes, the condition which we offer here seems to be the first one which guarantees that a closed subset of the set of relations of an association scheme is maximal. (C) 1997 Academic Press.
机译:我们为关联方案中的封闭子集最大化提供了充分的条件。该结果自然地概括了众所周知的(组理论)事实,即lambda = 1的2-设计的标志传递自同构组的单点稳定器必须是最大子组。在有限群论中,存在许多(重要的)充分条件使子群最大化。在关联方案理论中,我们在这里提供的条件似乎是第一个条件,它保证关联方案的关系集的闭合子集最大。 (C)1997学术出版社。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号