Skip to main content
SpringerLink
Log in

A GAP Package for Computation with Coherent Configurations

  • Conference paper
Book cover Mathematical Software – ICMS 2010 (ICMS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6327))

Included in the following conference series:

Abstract

We present a GAP package for computing with Schurian coherent configurations and their representations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. Benjamin/Cummings (1984)

    Google Scholar 

  2. Cameron, P.J.: Permutation groups. London Mathematical Society Student Texts, vol. 45. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  3. Miyamoto, I.: Computation of isomorphisms of coherent configurations. Ars Mathematica Contemporanea 3(1) (2010)

    Google Scholar 

  4. Pasechnik, D., Kini, K.: Cohcfg, a GAP package for coherent configurations (preliminary version) (2010), http://www1.spms.ntu.edu.sg/~dima/software/cohcfg-a1.tgz

  5. Schrijver, A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inform. Theory 51(8), 2859–2866 (2005)

    Article  MathSciNet  Google Scholar 

  6. de Klerk, E., Pasechnik, D.V., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular *-representation. Math. Prog. B 109, 613–624 (2007); e-print 2005-03-1083, Optimization Online

    Article  MATH  Google Scholar 

  7. de Klerk, E., Pasechnik, D.V., Maharry, J., Richter, B., Salazar, G.: Improved bounds for the crossing numbers of K m,n and K n . SIAM J. Discr. Math. 20, 189–202 (2006)

    Article  MATH  Google Scholar 

  8. Vallentin, F.: Symmetry in semidefinite programs. Linear Algebra Appl. 430(1), 360–369 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ivanov, A.A., Pasechnik, D.V., Seress, A., Shpectorov, S.: Majorana representations of the symmetric group of degree 4. J. of Algebra (submitted)

    Google Scholar 

  10. Grohe, M.: Fixed-point definability and polynomial time on graph with excluded minors. In: 25th IEEE Symposium on Logic in Computer Science, LICS 2010 (to appear 2010)

    Google Scholar 

  11. Weisfeiler, B. (ed.): On Construction and Identification of Graphs. LNM, vol. 558. Springer, Berlin (1976)

    MATH  Google Scholar 

  12. The GAP Group: GAP – Groups, Algorithms, and Programming, Version 4.4.12. (2008), http://www.gap-system.org

  13. Stein, W., et al.: Sage Mathematics Software (Version 4.4). The Sage Development Team (2010), http://www.sagemath.org

  14. Soicher, L.H.: GRAPE: a system for computing with graphs and groups. In: Finkelstein, L., Kantor, W. (eds.) Groups and Computation. DIMACS Series in Discrete Mathematics and Theoretical CS, vol. 11, pp. 287–291. AMS, Providence (1993)

    Google Scholar 

  15. Faradzev, I.A., Klin, M.H.: Computer package for computations with coherent configurations. In: ISSAC 1991, Proc. Symposium on Symbolic and Algebraic Computation, pp. 219–221. Association for Computing Machinery, New York (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

    Dmitrii V. Pasechnik & Keshav Kini

Authors
  1. Dmitrii V. Pasechnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keshav Kini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Operations Research and Institute of Theoretical Computer Science, ETH Zurich, 8092, Zurich, Switzerland

    Komei Fukuda

  2. LIX, CNRS, École polytechnique, 91128, Palaiseau cedex, France

    Joris van der Hoeven

  3. Fachbereich Mathematik, TU Darmstadt, 64289, Darmstadt, Germany

    Michael Joswig

  4. Department of Mathematics, Kobe University, 657-8501, Rokko, Kobe, Japan

    Nobuki Takayama

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pasechnik, D.V., Kini, K. (2010). A GAP Package for Computation with Coherent Configurations. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15582-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15581-9

  • Online ISBN: 978-3-642-15582-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation