Magma

MAGMA Computational Algebra System

Magma
 •  How to get Magma
 •  Download
 •  Online Demo
 
Resources
 •  Online Help
 •  Discovering Mathematics with Magma
 •  Citations
 •  How to cite Magma
 •  Contributors
 •  Links
 
 •  Contact us

Combinatorics

Algebraic Combinatorics

05Exx

[1] Christine Bachoc. Harmonic weight enumerators of nonbinary codes and MacWilliams identities. In Codes and Association Schemes (Piscataway, NJ, 1999), volume 56 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 1–23. Amer. Math. Soc., Providence, RI, 2001.
[2] Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, and Hiroyuki Nakasora. A construction of the sporadic Suzuki graph from U3(4). J. Combin. Theory Ser. A, 116(5):1056–1062, 2009.
[3] J. Buhler and Z. Reichstein. Symmetric functions and the phase problem in crystallography. Trans. Amer. Math. Soc., 357(6):2353–2377 (electronic), 2005.
[4] Marston Conder. Group actions on graphs, maps and surfaces with maximum symmetry. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 63–91. Cambridge Univ. Press, Cambridge, 2003.
[5] Paul-Olivier Dehaye. Joint moments of derivatives of characteristic polynomials. Algebra Number Theory, 2(1):31–68, 2008.
[6] Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger. Some graphs related to the small Mathieu groups. European Journal of Combinatorics, In Press, 2009.
[7] Steven T. Dougherty, Jon-Lark Kim, and Patrick Solé. Double circulant codes from two class association schemes. Adv. Math. Commun., 1(1):45–64, 2007.
[8] Anna Fukshansky and Corinna Wiedorn. C-extensions of the Petersen geometry for M22. European J. Combin., 20(3):233–238, 1999.
[9] Naoyuki Horiguchi, Masaaki Kitazume, and Hiroyuki Nakasora. The Hall-Janko graph and the Witt system W10. European J. Combin., 29(1):1–8, 2008.
[10] Naoyuki Horiguchi, Hiroyuki Nakasora, and Takehisa Wakabayashi. On the strongly regular graphs obtained from quasi-symmetric 2-(31, 7, 7) designs. Bull. Yamagata Univ. Natur. Sci., 16(1):1–6, 2005.
[11] M. Kasatani, T. Miwa, A. N. Sergeev, and A. P. Veselov. Coincident root loci and Jack and Macdonald polynomials for special values of the parameters. In Jack, Hall-Littlewood and Macdonald Polynomials, volume 417 of Contemp. Math., pages 207–225. Amer. Math. Soc., Providence, RI, 2006.
[12] J. D. Key and J. Moori. Codes, designs and graphs from the Janko groups J1 and J2. J. Combin. Math. Combin. Comput., 40:143–159, 2002.
[13] J. D. Key, J. Moori, and B. G. Rodrigues. On some designs and codes from primitive representations of some finite simple groups. J. Combin. Math. Combin. Comput., 45:3–19, 2003.
[14] M. (ed.) Klin, G.A. (ed.) Jones, A. (ed.) Jurisic, M. (ed.) Muzychuk, and I. (ed.) Ponomarenko. Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, Berlin, 2009.
[15] Klavdija Kutnar, Dragan Marušič, Štefko Miklavič, and Primož Šparl. Strongly regular tri-Cayley graphs. European J. Combin., 30(4):822–832, 2009.
[16] Cai Heng Li, Tian Khoon Lim, and Cheryl E. Praeger. Homogeneous factorisations of complete graphs with edge-transitive factors. J. Algebraic Combin., 29(1):107–132, 2009.
[17] Jamshid Moori and B. G. Rodrigues. A self-orthogonal doubly even code invariant under McL:2. J. Combin. Theory Ser. A, 110(1):53–69, 2005.
[18] Ju-Mok Oh. Arc-transitive elementary abelian covers of the Pappus graph. Discrete Math., In Press, 2009.
[19] Patric R. J. Östergård. Classifying subspaces of Hamming spaces. Des. Codes Cryptogr., 27(3):297–305, 2002.
[20] Geoffrey Pearce. Examples of rank 3 product action transitive decompositions. Des. Codes Cryptogr., 47(1-3):289–303, 2008.
[21] Doron Zeilberger. Deconstructing the Zeilberger algorithm. J. Difference Equ. Appl., 11(9):851–856, 2005.

Prev: Extremal Combinatorics Up: Combinatorics Next: Computational Methods

Valid HTML 4.01! Valid CSS!