Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

被引:0
|
作者
Miyamoto, Izumi [1 ]
机构
[1] Yamanashi Univ, Kofu, Japan
关键词
Association schemes - Isomorphisms - Normalizers - Permutation;
D O I
10.1145/345542.345637
中图分类号
学科分类号
摘要
引用
收藏
页码:220 / 224
相关论文
共 50 条
  • [31] On the paper "Association schemes for diagonal groups"
    Cameron, Peter J.
    Eberhard, Sean
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2020, 78 : 450 - 450
  • [32] Association schemes and metrics on finite groups
    Sidel'nikov, VM
    DOKLADY MATHEMATICS, 2004, 69 (03) : 400 - 403
  • [33] Computing exact permutation p-values for association rules
    Wu, Jun
    He, Zengyou
    Gu, Feiyang
    Liu, Xiaoqing
    Zhou, Jianyu
    Yang, Can
    INFORMATION SCIENCES, 2016, 346 : 146 - 162
  • [34] Computing chief series, composition series and socles in large permutation groups
    Cannon, JJ
    Holt, DF
    JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) : 285 - 301
  • [35] Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques
    Zhang, Chen
    Zhang, Wenjie
    Zhang, Ying
    Qin, Lu
    Zhang, Fan
    Lin, Xuemin
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 1211 - 1220
  • [36] A REMARK ON ASSOCIATION SCHEMES ON FINITE-GROUPS
    BIER, T
    CHENG, KN
    HARTLEY, B
    ARCHIV DER MATHEMATIK, 1988, 51 (06) : 481 - 484
  • [37] CLASSICAL-GROUPS AND METRIC ASSOCIATION SCHEMES
    ZHDANPUSHKIN, VV
    USTIMENKO, VA
    CYBERNETICS, 1986, 22 (06): : 697 - 706
  • [38] CONSTRUCTION OF ORTHOGONAL TABLES USING PERMUTATION GROUPS
    LECOINTE, P
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1974, 278 (05): : 367 - 369
  • [39] On defining groups efficiently without using inverses
    Campbell, CM
    Mitchell, JD
    Ruskuc, N
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2002, 133 : 31 - 36