Design Theory Resource Server

Preprints and Research Reports

Click on the title to get the full article in PDF format.

In the case of published articles, the preprint here is not necessarily identical with the published version.

• Ranks and signatures of adjacency matrices
  by S. Akbari, P. J. Cameron and G. B. Khosrovshahi; submitted.
• On the structure of 1-designs with at most two block intersection numbers
  by John Arhin; Designs, Codes, Cryptography 43 (2007), 103-114;
  doi: 10.1007/s10623-007-9067-4
• Every SOMA(n-2,n) is Trojan
  by John Arhin; Discrete Math. 310 (2010), 303-311;
  doi: 10.1016/j.disc.2008.09.050
• Association Schemes: Designed experiments, Algebra and Combinatorics
  a book by R. A. Bailey; Cambridge University Press, 2004; ISBN 052182446X.
• Balanced colourings of strongly regular graphs
  by R. A. Bailey; Discrete Mathematics 293 (2005), 73-90;
  doi: 10.1016/j.disc.2004.08.022
• Six families of efficient resolvable designs in three replicates
  by R. A. Bailey; to appear in Metrika
• Generalized wreath products of association schemes
  by R. A. Bailey; European Journal of Combinatorics 27 (2006), 428-435;
  doi: 10.1016/j.ejc.2004.11.002
• Designs for one-sided neighbour effects
  by R. A. Bailey; Indian Journal of Agricultural Statistics 56 (2003), 302-314.
• Crested products of association schemes
  by R. A. Bailey and Peter J. Cameron; J. London Math. Soc. 72 (2005), 1-24;
  doi: 10.1112/S0024610705006666
• A family of balanced incomplete-block designs with repeated blocks on which general linear groups act
  by R. A. Bailey and Peter J. Cameron; J. Combinatorial Designs 15 (2007), 143-150;
  doi: 10.1002/jcd.20120
• What is a design? How should we classify them?
  by R. A. Bailey and Peter J. Cameron, Designs, Codes and Cryptography 44 (2007), 223-238;
  doi: 10.1007/s10623-007-9092-3
• Combinatorics of optimal designs
  by R. A. Bailey and Peter J. Cameron; Draft of BCC paper.
• Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes
  by R. A. Bailey, Peter J. Cameron and Robert Connelly; American Math. Monthly 115 (2008), 383-404.
• Designs on the Web
  by R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher; Discrete Mathematics 306 (2006), 3014-3027;
  doi: 10.1016/j.disc.2004.10.027
• On optimal cross-over designs when carry-over effects are proportional to direct effects
  by R. A. Bailey and J. Kunert; to appear in Biometrika.
• On the single-orbit conjecture for uncoverings-by-bases
  by Robert F. Bailey and Peter J. Cameron; J. Group Theory 11 (2008), 845-850;
  doi: 10.1515/JGT.2008.053
• Self-dual, not self-polar
  by A. E. Brouwer, Peter J. Cameron, W. H. Haemers and D. A. Preece; Discrete Mathematics 306 (2006), 3051-3053;
  doi: 10.1016/j.disc.2004.11.027
• Automorphisms of graphs
  by Peter J. Cameron; Topics in Algebraic Graph Theory (L.W. Beineke and R.J. Wilson, eds), Cambridge University Press, 2004 (ISBN 0521801974), pp. 137-155.
• Strongly regular graphs
  by Peter J. Cameron; Topics in Algebraic Graph Theory (L.W. Beineke and R.J. Wilson, eds), Cambridge University Press, 2004 (ISBN 0521801974), pp. 203-221.
• Designs
  by Peter J. Cameron; an article for Princeton Companion to Mathematics (ed. W. T. Gowers), Princeton University Press; ISBN: 0-691-11880-9; published March 2008.
• Finite geometry and permutation groups: some polynomial links
  by Peter J. Cameron; Rendiconti di Matematica (VII) 26 (2006), 339-350.
• Embedding partial Steiner triple systems so that automorphisms extend
  by Peter J. Cameron; Journal of Combinatorial Designs 13 (2005), 466-470;
  doi: 10.1002/jcd.20057
• A generalisation of t-designs
  by Peter J. Cameron; Discrete Math. 309 (2009), 4835-4842;
  doi: 10.1016/j.disc.2008.07.005
• Root systems and optimal block designs
  by Peter J. Cameron; submitted to Michigan Math. J.
• Permutation codes
  by Peter J. Cameron; submitted to Europ. J. Combinatorics
• Designs and matroids
  by Peter J. Cameron and M. M. Deza; a chapter in the Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), CRC Press; ISBN: 1584885068; published November 2006.
• Random preorders and alignments
  by Peter J. Cameron, Mihyun Kang and Dudley Stark; to appear in Discrete Mathematics.
• Tubes in PG(3,q),
  by Peter Cameron and Norbert Knarr; European Journal of Combinatorics 27 (2006), 114-124;
  doi: 10.1016/j.ejc.2004.07.001
• 3-designs from PSL(2,q)
  by P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie; Discrete Mathematics 306 (2006), 3063-3073;
  doi: 10.1016/j.disc.2005.06.041
• 3-designs from PGL(2,q)
  by P. J. Cameron, G. R. Omidi and B. Tayfeh-Rezaie; Electronic J. Combinatorics 13 (2006), #R50 (11pp.)

• Asymptotic enumeration of incidence matrices
  by Peter J. Cameron, Thomas Prellberg and Dudley Stark; Journal of Physics (Conference Series) 42 (2006), 59-70;
  doi: 10.1088/1742-6596/42/1/007
• Asymptotics for incidence matrix classes
  by Peter J. Cameron, Thomas Prellberg and Dudley Stark; Electronic J. Combinatorics 13 (2006), #R85 (19pp.)
• A design and a geometry for the Fischer group Fi₂₂
  by Peter J. Cameron and A. Rudvalis; Designs, Codes, Cryptography 44 (2007), 11-14;
  doi: 10.1007/s10623-007-9041-1
• Semiregular automorphisms of vertex-transitive cubic graphs
  by Peter J. Cameron, John Sheehan and Pablo Spiga; European Journal of Combinatorics 27 (2006), 924-930 (PostScript);
  doi: 10.1016/j.ejc.2005.04.008
• Block intersection polynomials
  by Peter J. Cameron and Leonard H. Soicher; Bull. London Math. Soc. 39 (2007), 559-564;
  doi: 10.1112/blms/bdm034
• Min-wise independent groups with respect to any linear order
  by Peter J. Cameron and Pablo Spiga; Communications in Algebra 35 (2007), 3026-3033;
  doi: 10.1080/00927870701404812
• Covering radius for sets of permutations
  by Peter J. Cameron and Ian M. Wanless; Discrete Mathematics 293 (2005), 91-109;
  doi: 10.1016/j.disc.2004.08.024
• Infinite designs
  by Peter J. Cameron and Bridget S. Webb; a chapter in the Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), CRC Press; ISBN: 1584885068; published November 2006.
• The complexity of the weight problem for permutation and matrix groups
  by Peter J. Cameron and Taoyang Wu; to appear in Discrete Mathematics.
• On balanced incomplete-block designs with repeated blocks
  by P. Dobcsányi, D.A. Preece, L.H. Soicher; European Journal of Combinatorics 28 (2007), 1955-1970;
  doi: 10.1016/j.ejc.2006.08.007
• Optimal saturated block designs when observations are correlated
  by Bo Jin and J. P. Morgan; to appear in Journal of Statistical Planning and Inference.
  doi: 10.1016/j.jspi.2006.06.048
• Constructing t-designs from t-wise balanced designs
  by John P. McSorley and Leonard H. Soicher; European Journal of Combinatorics 28 (2007), 567-571;
  doi: 10.1016/j.ejc.2005.02.003
• Nested designs
  by J. P. Morgan; a chapter in the Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), CRC Press; ISBN: 1584885068; published November 2006.
• Optimal resovable designs with minimum PV aberration
  by J. P. Morgan; submitted.
• Latin squares and related experimental designs
  by J. P. Morgan; a chapter in the Encyclopedia of Statistics in Quality and Reliability, to appear.
• Optimal incomplete block designs
  by J. P. Morgan; Journal of The American Statistical Association 102 (2007), 655-663.
  doi: 10.1198/016214506000001329
• Optimal Experimentation in Two Blocks
  by J. P. Morgan and Bo Jin; Journal of Statistical Theory and Practice 1 , 2007, 357-375.
• Review of "Modern Experimental Design" by Thomas P. Ryan
  by J. P. Morgan; Journal of Statistical Theory and Practice 1 , 2007, 501-506.
• Most robust BIBDs
  by J. P. Morgan and Valentin Parvu; to appear in Statistica Sinica.
• Optimal row-column design for three treatments
  by J. P. Morgan and Valentin Parvu; Journal of Statistical Planning and Inference 137 (2007), 1474-1487.
  doi: 10.1016/j.jspi.2006.02.006
• Resolvable designs with large blocks
  by J. P. Morgan and Brian H. Reck; Annals of Statistics 35 (2007), 747-771.
  doi: 10.1214/009053606000001253
• E-optimal design in irregular BIBD settings
  by J. P. Morgan and Brian H. Reck; Journal of Statistical Planning and Inference 137 (2007), 1658-1668.
  doi: 10.1016/j.jspi.2006.09.015
• E-optimal designs for three treatments
  by Valentin Parvu and J. P. Morgan; Journal of Statistical Planning and Inference 138 (2008), 642-653.
  doi: 10.1016/j.jspi.2006.12.008
• Optimal design in irregular BIBD settings
  by Brian H. Reck and J. P. Morgan; Journal of Statistical Planning and Inference 129 (2005) 59-84.
  doi: 10.1016/j.jspi.2004.06.039
• Computing with graphs and groups
  by Leonard H. Soicher; Topics in Algebraic Graph Theory (L.W. Beineke and R.J. Wilson, eds), Cambridge University Press, 2004 (ISBN 0521801974), pp. 250-266.
• Is there a McLaughlin geometry?
  by Leonard H. Soicher; J. Algebra 300 (2006), 248-255;
  doi: 10.1016/j.jalgebra.2006.02.023
• Computational group theory problems arising from computational design theory
  by Leonard H. Soicher; Oberwolfach Rep. 3 (2006), Report 30/2006: Computational group theory, 1809-1811.
• On classifying objects with specified groups of automorphisms, friendly subgroups, and Sylow tower groups
  by Leonard H. Soicher; to appear in Portugaliae Mathematica.
• More on block intersection polynomials and new applications to graphs and block designs
  by Leonard H. Soicher; J. Comb. Theory, Ser. A, 117 (2010), 799-809;
  doi: 10.1016/j.jcta.2010.03.005
• On generalised t-designs and their parameters
  by Leonard H. Soicher; Discrete Math. 311 (2011), 1136-1141;
  doi: 10.1016/j.disc.2010.08.002
• Uniform semi-Latin squares and their Schur-optimality
  by Leonard H. Soicher; J. Combin. Des. 20 (2012), 265-277;
  doi: 10.1002/jcd.21300
• Optimal and efficient semi-Latin squares
  by Leonard H. Soicher; submitted.
• Designs, groups and computing (based on lectures given at the Fifth de Brún Workshop, Galway, 2011)
  by Leonard H. Soicher; submitted.