<html><head><title>design : a GAP 4 package - References</title></head>
<body text="#000000" bgcolor="#ffffff">
<h1><font face="Gill Sans,Helvetica,Arial">design</font> : a <font face="Gill Sans,Helvetica,Arial">GAP</font> 4 package - References</h1><dl>
<dt><a name="BaCh"><b>[BaCh]</b></a><dd>
R. A. Bailey and P. E. Chigbu.
<br> Enumeration of semi-latin squares.
<br> <em>Discrete Math.</em>, 167-168:73--84, 1997.
<br> <a href="https://doi.org/10.1016/S0012-365X(96)00217-8">https://doi.org/10.1016/S0012-365X(96)00217-8</a>.
<dt><a name="BaCa"><b>[BaCa]</b></a><dd>
R. A. Bailey and P. J. Cameron.
<br> Combinatorics of optimal designs.
<br> In S. Huczynska, J. D. Mitchell, and C. M. Roney-Dougal, editors,
<em>Surveys in Combinatorics 2009</em>, volume 365 of <em>London Math. Soc.
Lecture Note Series</em>, pages 19--73. Cambridge University Press, 2009.
<dt><a name="Dotw"><b>[Dotw]</b></a><dd>
R. A. Bailey, P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher.
<br> Designs on the web.
<br> <em>Discrete Math.</em>, 306:3014--3027, 2006.
<br> <a href="https://doi.org/10.1016/j.disc.2004.10.027">https://doi.org/10.1016/j.disc.2004.10.027</a>.
<dt><a name="BaRo"><b>[BaRo]</b></a><dd>
R. A. Bailey and G. Royle.
<br> Optimal semi-latin squares with side six and block size two.
<br> <em>Proc. Roy. Soc. London, Ser. A</em>, 453:1903--1914, 1997.
<br> <a href="https://doi.org/10.1098/rspa.1997.0102">https://doi.org/10.1098/rspa.1997.0102</a>.
<dt><a name="Extrep"><b>[Extrep]</b></a><dd>
P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher.
<br> <em>The external representation of block designs, Version 2.0</em>,
2004.
<br>
<a href="https://webspace.maths.qmul.ac.uk/l.h.soicher/designtheory.org/library/extrep/">https://webspace.maths.qmul.ac.uk/l.h.soicher/designtheory.org/library/extrep/</a>.
<dt><a name="CaSo"><b>[CaSo]</b></a><dd>
P. J. Cameron and L. H. Soicher.
<br> Block intersection polynomials.
<br> <em>Bull. Lond. Math. Soc.</em>, 39:559--564, 2007.
<br> <a href="https://doi.org/10.1112/blms/bdm034">https://doi.org/10.1112/blms/bdm034</a>.
<dt><a name="JK07"><b>[JK07]</b></a><dd>
T. Juntilla and P. Kaski.
<br> Engineering an efficient canonical labeling tool for large and sparse
graphs.
<br> In D. Applegate et al., editor, <em>Proceedings of the Ninth
Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on
Analytic Algorithmics and Combinatorics</em>, pages 135--149. SIAM, 2007.
<br> bliss homepage: <a href="http://www.tcs.hut.fi/Software/bliss/">http://www.tcs.hut.fi/Software/bliss/</a>.
<dt><a name="Nau90"><b>[Nau90]</b></a><dd>
B. D. McKay.
<br> <em>nauty user's guide (version 1.5), Technical report
TR-CS-90-02</em>.
<br> Australian National University, Computer Science Department, 1990.
<br> nauty homepage: <a href="http://cs.anu.edu.au/people/bdm/nauty/">http://cs.anu.edu.au/people/bdm/nauty/</a>.
<dt><a name="MP14"><b>[MP14]</b></a><dd>
B. D. McKay and A. Piperno.
<br> Practical graph isomorphism, ii.
<br> <em>J. Symbolic Comput.</em>, 60:94--112, 2014.
<br> <a href="https://doi.org/10.1016/j.jsc.2013.09.003">https://doi.org/10.1016/j.jsc.2013.09.003</a>.
<dt><a name="McSo"><b>[McSo]</b></a><dd>
J. P. McSorley and L. H. Soicher.
<br> Constructing t-designs from t-wise balanced designs.
<br> <em>European J. Combin.</em>, 28:567--571, 2007.
<br> <a href="https://doi.org/10.1016/j.ejc.2005.02.003">https://doi.org/10.1016/j.ejc.2005.02.003</a>.
<dt><a name="Soi10"><b>[Soi10]</b></a><dd>
L. H. Soicher.
<br> More on block intersection polynomials and new applications to graphs
and block designs.
<br> <em>J. Comb. Theory, Ser. A</em>, 117:799--809, 2010.
<br> <a href="https://doi.org/10.1016/j.jcta.2010.03.005">https://doi.org/10.1016/j.jcta.2010.03.005</a>.
<dt><a name="Soi13"><b>[Soi13]</b></a><dd>
L. H. Soicher.
<br> Designs, groups and computing.
<br> In A. Detinko, D. Flannery, and E. O'Brien, editors,
Probabilistic Group Theory, Combinatorics, and Computing. Lectures from the
Fifth de Brún Workshop</em>, volume 2070 of <em>Lecture Notes in
Mathematics</em>, pages 83--107. Springer, Berlin, Heidelberg and New York, 2013.
<dt><a name="Grape"><b>[Grape]</b></a><dd>
L. H. Soicher.
<br> <em>The GRAPE package for GAP, Version 4.9.2</em>, 2024.
<br> <a href="https://gap-packages.github.io/grape">https://gap-packages.github.io/grape</a>.
<dt><a name="Soi24"><b>[Soi24]</b></a><dd>
L. H. Soicher.
<br> Using GAP packages for research in graph theory, design theory, and
finite geometry.
<br> In A. A. Ivanov, editor, <em>Algebraic Combinatorics and the Monster
Group</em>, volume 487 of <em>London Math. Soc. Lecture Note Series</em>, pages
527--566. Cambridge University Press, 2024.
<br> accepted manuscript available at:
<a href="https://webspace.maths.qmul.ac.uk/l.h.soicher/g2g2_final.pdf">https://webspace.maths.qmul.ac.uk/l.h.soicher/g2g2_final.pdf</a>.
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
