Journal of Mathematical Sciences

, Volume 192, Issue 3, pp 316–338 | Cite as

Bases of schurian antisymmetric coherent configurations and an isomorphism test for schurian tournaments

Article
First Online:
Received:

It is known that for any permutation group G of odd order there exists a subset of the permuted set whose stabilizer in G is trivial, and if G is primitive, then there also exists a base of size at most 3. These results are generalized to the coherent configuration of G, which in this case is schurian and antisymmetric. This enables us to construct a polynomial-time algorithm for recognizing and isomorphism testing of schurian tournaments (i.e., arc-colored tournaments whose coherent configurations are schurian). Bibliography: 24 titles.

Keywords

Permutation Group Isomorphism Test Coherent Configuration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Arvind, B. Das, and P. Mukhopadhyay, “Isomorphism and canonization of tournaments and hypertournaments,” J. Comput. System Sci., 76, 509–523 (2010).MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    L. Babai, “On the order of uniprimitive permutation groups,” Ann. Math., 113, 553–568 (1981).MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    L. Babai and E. M. Luks, “Canonical labeling of graphs,” in: Proceedings of the 15th ACM STOC (1983), pp. 171–183.Google Scholar
  4. 4.
    R. F. Bailey and P. J. Cameron, “Base size, metric dimension and other invariants of groups and graphs,” Bull. London Math. Soc., 43, 209–242 (2011).MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    S. Evdokimov and I. Ponomarenko, “On primitive cellular algebras,” Zap. Nauchn. Semin. POMI, 256, 38–68 (1999).Google Scholar
  6. 6.
    S. Evdokimov and I. Ponomarenko, “On highly closed cellular algebras and highly closed isomorphisms,” Electron. J. Combin., 6, #R18, 1–31 (1999).MathSciNetGoogle Scholar
  7. 7.
    S. Evdokimov and I. Ponomarenko, “Two-closure of odd permutation group in polynomial time,” Discrete Math., 235, No. 1–3, 221–232 (2001).MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    S. Evdokimov and I. Ponomarenko, “Characterization of cyclotomic schemes and normal Schur rings over a cyclic group,” Algebra Analiz, 14, No. 2, 11–55 (2002).MathSciNetGoogle Scholar
  9. 9.
    S. Evdokimov and I. Ponomarenko, “Circulant graphs: recognizing and isomorphism testing in polynomial time,” Algebra Analiz, 15, No. 6, 1–34 (2003).MathSciNetGoogle Scholar
  10. 10.
    S. Evdokimov and I. Ponomarenko, “Permutation group approach to association schemes,” European J. Combin., 30, No. 6, 1456–1476 (2009).MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    S. Evdokimov, I. Ponomarenko, and G. Tinhofer, “Forestal algebras and algebraic forests (on a new class of weakly compact graphs),” Discrete Math., 225, 149–172 (2000).MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    A. Espuelas, “Regular orbits on symplectic modules,” J. Algebra, 138, 1–12 (1991).MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    A. Espuelas, “Large character degrees of groups of odd order,” Illinois J. Math., 35, 499–505 (1991).MathSciNetMATHGoogle Scholar
  14. 14.
    The GAP Group, GAP-4-Groups, Algorithms, and Programming, Version 4.4.5 (2005), http://www.gap-system.org.
  15. 15.
    D. Gluck, “Trivial set-stabilizers in finite permutation groups,” Canad. J. Math., XXXV, 59–67 (1983).MathSciNetCrossRefGoogle Scholar
  16. 16.
    G. A. Jones, M. Klin, and Y. Moshe, “Primitivity of permutation groups, coherent algebras, and matrices,” J. Combin. Theory, A98, 210–217 (2002).MathSciNetCrossRefGoogle Scholar
  17. 17.
    O. Manz and T. Wolf, Representations of Solvable Groups, London Math. Soc. Lect. Notes, 185, Cambridge Univ. Press, Cambridge (1993).Google Scholar
  18. 18.
    M. Muzychuk and I. Ponomarenko, “On pseudocyclic association schemes,” Ars Math. Contemp., 5, No. 1, 1–25 (2012).MathSciNetMATHGoogle Scholar
  19. 19.
    A. Seress, “The minimal base size of primitive solvable permutation groups,” J. London Math. Soc., 53, 243–255 (1996).MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    A. Seress, Permutation Group Algorithms, Cambridge Univ. Press, Cambridge (2002).Google Scholar
  21. 21.
    D. A. Suprunenko, Matrix Groups, Amer. Math. Soc., Providence, Rhode Island (1976).Google Scholar
  22. 22.
    Y. Yang, “Regular orbits of finite primitive solvable groups,” J. Algebra, 323, 2735–2755 (2010).MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    B. Weisfeiler (ed.), On Construction and Identification of Graphs, Lect. Notes Math., 558, Springer-Verlag (1976).Google Scholar
  24. 24.
    P.-H. Zieschang, Theory of Association Schemes, Springer, Berlin–Heidelberg (2005).MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.St. Petersburg Department of the Steklov Mathematical InstituteSt. PetersburgRussia

Personalised recommendations