Peter Cameron's publications 2000-2009

See also the list of publications in Pure Mathematics by members of the Mathematics Research Centre at Queen Mary. Details about my preprints and other writings can be found here, and abstracts of my papers since 1995 are here.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2009:

A generalisation of t-designs, Discrete Math. 309 (2009), 4835-4842; doi: 10.1016/j.disc.2008.07.005
Decompositions of complete multipartite graphs, Discrete Math. 309 (2009), 4185-4186; doi: 10.1016/j.disc.2008.10.021
Root systems and optimal block designs, Michigan Math. J. 58 (2009), 181-194; doi: 10.1307/mmj/1242071687
Oligomorphic permutation groups, in Perspectives in Mathematical Sciences II: Pure Mathematics (ed. N. S. Narasimha Sastry, T. S. S. R. K. Rao, Mohan Delampady and B. Rajeev), World Scientific, Singapore, 2009, pp. 37-61; ISBN 978-981-4273-64-0
(with C. Buchheim and T. Wu) On the subgroup distance problem, Discrete Math. 309 (2009), 962-968; doi: 10.1016/j.disc.2008.01.036
(with S. Riis and T. Wu) On the guessing number of shift graphs, J. Discrete Algorithms 7 (2009), 220-226; doi: 10.1016/j.jda.2008.09.009
(with R. A. Bailey) Combinatorics of Optimal Designs, in Surveys in Combinatorics 2009 (ed. S. Huczynska, J. D. Mitchell and C. M. Roney-Dougal), London Math. Soc. Lecture Notes 365, Cambridge University Press 2009, pp. 19-73.
(with Ross Applegate) Orbits on n-tuples, Communications in Algebra 37 (2009), 269-275; doi: 10.1080/00927870802243739
Finite geometry and permutation groups: some polynomial links, Rendiconti Accademia Nazionale delle Scienze detta dei XL, Memorie du Matematica e Applicazioni 125 (2009), 25-36 (reprint of article in Rendiconti di Matematica (VII) 26 (2006), 339-350).
Book review: The Unfinished Game: Pascal, Fermat and the Seventeenth-Century Letter that Made the World Modern by Keith Devlin, Times Higher Education 7 May 2009, 50-51.
Across the Banks peninsula, Strider 113 (2009), 30-32.
Walking and maths in Banff, Strider 115 (2009), 59-61.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2008:

(with Priscila A. Kazanidis) Cores of symmetric graphs, J. Australian Math. Soc. 85 (2008), 145-154; doi: 10.1017/S1446788708000815
Designs (III.14, pp. 172-173) and Gödel's Theorem (V.15, pp. 700-702) in Princeton Companion to Mathematics (ed. W. T. Gowers), Princeton University Press, 2008.
(with Robert F. Bailey) On the single-orbit conjecture for uncoverings-by-bases, J. Group Theory 11 (2008), 845-850; doi: 10.1515/JGT.2008.053
(with Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer) Counting defective parking functions, Electronic J. Combinatorics 15(1) (2008), #R92 (15pp).
(with Sam Tarzi) Limits of cubes, Topology and its Applications 155 (2008), 1454-1461; doi: 10.1016/j.topol.2008.03.022
(with R. A. Bailey and R. Connelly) Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes, American Math. Monthly 115 (2008), 383-404; Chinese translation Shuxue Yilin (Mathematical Advance in Translation) 29 (2009), 21-39.
(with B. Jackson and J. Rudd) Orbit-counting polynomials for graphs and codes, Discrete Math. 308 (2008), 920-930; doi: 10.1016/j.disc.2007.07.108
(Editor, with Douglas B. West) Research problems from BCC20, Discrete Math. 308 (2008), 621-630; doi: 10.1016/j.disc.2007.07.021
(with D. Gewurz and F. Merola) Product action, Discrete Math. 308 (2008), 386-394; doi: 10.1016/j.disc.2006.11.054
Introduction to Algebra (2nd edition), Oxford University Press:
- Hardback: ISBN13: 9780198569138; ISBN10: 0198569130
- Paperback: ISBN13: 9780198527930; ISBN10: 0198527934
(with J. H. van Lint) Graphs, Codes and Designs (paperback reissue, Cambridge University Press, 2008; first published in London Math. Soc Lecture Note Series 43, 1980). ISBN: 9780521231411.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2007:

(with Ashley Montanaro, Michael W. Newman, Simone Severini and Andreas Winter) On the quantum chromatic number of a graph, Electronic Journal of Combinatorics 14(1) (2007), #R82 (15pp).
(with Natalia Iyudu) Graphs of relations and Hilbert series, J. Symbolic Computation 42 (2007), 1066-1078; doi: 10.1016/j.jsc.2007.07.006
(with Pablo Spiga) Min-wise independent families with respect to any linear order, Communications in Algebra 35 (2007), 3026-3033; doi: 10.1080/00927870701404812
(with R. A. Bailey) What is a design? How should we classify them? Designs, Codes, Crypt. 44 (2007), 223-238; doi: 10.1007/s10623-007-9092-3
(with A. Rudvalis) A design and a geometry for the group F₂₂, Designs, Codes, Crypt. 44 (2007), 11-14; doi: 10.1007/s10623-007-9041-1
(with Leonard Soicher) Block intersection polynomials, Bull. London Math. Soc. 39 (2007), 559-564; doi: 10.1112/blms/bdm034
(with T. Wu) The complexity of the Weight Problem for permutation groups, Electr. Notes Discrete Math. 28 (2007), 109-116; doi: 10.1016/j.endm.2007.01.034
(with K. K. Kayibi) Orbital chromatic and flow roots, Combinatorics, Probability and Computing 16 (2007), 401-407; doi: 10.1017/S0963548306008200
(with J. Cilleruelo and O. Serra) On monochromatic solutions of equations in groups, Revista Matemática Iberoamericana 23 (2007), 385-395.
Aspects of infinite permutation groups, in Groups St Andrews 2005 volume 1 (ed. C. M. Campbell, M. R. Quick, E. F. Robertson and G. C. Smith), London Math. Soc. Lecture Notes 339, Cambridge Univ. Press, Cambridge, 2007, pp. 1-35; ISBN 0-521-69469-8.
(with R. A. Bailey) A family of balanced incomplete-block designs with repeated blocks on which general linear groups act, J. Combinatorial Designs 15 (2007), 143-150; doi: 10.1002/jcd.20120
Orbit counting and the Tutte polynomial, Combinatorics, Complexity and Chance (ed. G. Grimmett and C. McDiarmid), Oxford Lecture Series in Mathematics and Its Applications 34, Oxford University Press, 2007, pp.1-10; ISBN: 9780198571278
Maths matters: Publishing and assessing mathematics, Gazette of the Australian Mathematical Society 34 (2007), 253-257
Book review: The Mathematician's Brain: A Personal Tour through the Essentials of Mathematics and Some of the Great Brains behind them by David Ruelle, and How Mathematicians Think: Using Ambiguity, Contradiction and Paradox to Create Mathematics by William Byers, both Princeton University Press 2007, Times Higher, 14 September 2007, 24-25.
Parallelisms of Complete Designs (paperback reissue, Cambridge University Press, 2007; first published in London Math. Soc Lecture Note Series 23, 1976). ISBN: 97805212116043.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2006:

Finite geometry and permutation groups: some polynomial links, Rendiconti di Matematica (VII) 26 (2006), 339-350.
(with Bridget S. Webb) Infinite designs, in Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), Discrete Mathematics and its Applications 42, Chapman & Hall/CRC, 2006, Chapter VI.30 (pp.504-505); ISBN: 1584885068.
(with Michel M. Deza) Designs and Matroids, in Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), Discrete Mathematics and its Applications 42, Chapman & Hall/CRC, 2006, Chapter VII.10 (pp.847-851); ISBN: 1584885068.
Matrix groups, chapter 67 in Handbook of Linear Algebra (ed. L. Hogben), Discrete Mathematics and its Applications 39, Chapman & Hall/CRC, 2006; ISBN: 1584885106.
(with R. A. Bailey, P. Dobcsányi, J. P. Morgan, and L. H. Soicher) Designs on the Web, Discrete Math. 306 (2006), 3014-3027; doi: 10.1016/j.disc.2004.10.027
(with A. E. Brouwer, W. H. Haemers and D. A. Preece) Self-dual, not self-polar, Discrete Math. 306 (2006), 3051-3053; doi: 10.1016/j.disc.2004.11.027
(with H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie) 3-designs from PSL(2,q), Discrete Math. 306 (2006), 3063-3073; doi: 10.1016/j.disc.2005.06.041
(with Charles R. Johnson), The number of equivalence classes of symmetric sign patterns, Discrete Math. 306 (2006), 3074-3077; doi: 10.1016/j.disc.2004.10.0 29
(editor) Problem session from Combinatorics, Linear Algebra and Graph Coloring (Tehran 2003), Discrete Math. 306 (2006), 3174-3179; doi: 10.1016/j.disc.2006.06.002
(with T. Prellberg and D. Stark) Asymptotics for incidence matrix classes, Electronic J. Combinatorics 13 (2006), #R85 (19pp.)
(with A. M. Vershik) Some isometry groups of the Urysohn space, Ann. Pure Appl. Logic 143 (2006), 70-78; doi: 10.1016/j.apal.2005.08.001
(with A. W. Dent) Orbit-homogeneity in permutation groups, Bull. London Math. Soc. 38 (2006), 597-606; doi: 10.1112/S0024609306018601
(with T. Prellberg and D. Stark) Asymptotic enumeration of incidence matrices, Journal of Physics: Conference Series 42 (2006), 59-70; doi: 10.1088/1742-6596/42/1/007
(with G. R. Omidi and B. Tayfeh-Rezaie) 3-designs from PGL(2,q), Electronic J. Combinatorics 13 (2006), #R50 (11pp.)
(with J. Sheehan and P. Spiga) Semiregular automorphisms of vertex-transitive cubic graphs, Europ. J. Combinatorics 27 (2006), 924-930; doi: 10.1016/j.ejc.2005.04.008
(with J. Nešetřil) Homomorphism-homogeneous relational structures, Combinatorics, Probability and Computing 15 (2006), 91-103; doi: 10.1017/S0963548305007091
(with Norbert Knarr) Tubes in PG(3,q), Europ. J. Combinatorics 27 (2006), 114-124; doi: 10.1016/j.ejc.2004.07.001

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2005:

(with T. W. Müller) A descent principle in modular subgroup arithmetic, J. Pure Appl. Algebra 203 (2005), 189-203; doi: 10.1016/j.jpaa.2005.03.013
Embedding partial Steiner triple systems so that their automorphisms extend, J. Combinatorial Designs 13 (2005), 466-470; doi: 10.1002/jcd.20057
(with R. A. Bailey) Crested products of association schemes, J. London Math. Soc. 72 (2005), 1-24; doi: 10.1112/S0024610705006666
(with Ian M. Wanless) Covering radius for sets of permutations, Discrete Math. 293 (2005), 91-109; doi: 10.1016/j.disc.2004.08.024
(editor) Problems from the 19th British Combinatorial Conference, Discrete Math. 293 (2005), 313-320; doi: 10.1016/j.disc.2005.02.006
Tribute to Roland Fraïssé, Discrete Math. 291 (2005), 3; doi: 10.1016/j.disc.2004.10.004
The random graph has the strong small index property, Discrete Math. 291 (2005), 41-43; doi: 10.1016/j.disc.2004.04.018
Partitions and permutations, Discrete Math. 291 (2005), 45-54; doi: 10.1016/j.disc.2004.04.019
Book review: Spectral Generalizations of Line Graphs: on graphs with least eigenvalue -2 by D. Cvetkovic, P. Rowlinson and S. Simic, Bull. London Math. Soc. 37 (2005), 479-480; doi: 10.1112/S0024609305224463

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2004:

(with Lowell Beineke and Robin Wilson) Introduction, in Topics in Algebraic Graph Theory (ed. L. W. Beineke and R. J. Wilson), Cambridge Univ. Press, Cambridge, 2004 (ISBN 0521801974), pp.1-29.
Automorphisms of graphs, in Topics in Algebraic Graph Theory (ed. L. W. Beineke and R. J. Wilson), Cambridge Univ. Press, Cambridge, 2004 (ISBN 0521801974), pp.137-155.
Strongly regular graphs, in Topics in Algebraic Graph Theory (ed. L. W. Beineke and R. J. Wilson), Cambridge Univ. Press, Cambridge, 2004 (ISBN 0521801974), pp. 203-221.
Combinatorics and Groups: Peter Cameron's IPM Lecture Notes, IPM Lecture Notes Series 4, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, 2004, 86pp.
(with T. W. Müller) A cohomological property of p-groups, Archiv der Mathematik 82 (2004), 200-204; doi: 10.1007/s00013-003-4865-z
(with S. Tarzi) Switching with more than two colours, Europ. J. Combinatorics 25 (2004), 169-177; doi: 10.1016/S0195-6698(03)00097-0
Topology in permutation groups, in Groups: Topological, Combinatorial and Arithmetic Aspects (ed. T. W. Müller), London Math. Soc. Lecture Notes 311, Cambridge University Press, Cambridge, 2004, pp. 93-105.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2003:

Combinatoria, in Storia della scienza (editor-in-chief Sandro Petruccioli), Istituto della Enciclopedia Italiana (10 vols), Roma, 2001-2004, Vol. IX (2003), pp. 335-344.
(with P. Dobcsányi, J. P. Morgan and L. H. Soicher) The External Representation of Block Designs, version 1.1, 2003.
Random strongly regular graphs?, Discrete Math. 273 (2003), 101-112.
(with C. Y. Ku) Intersecting families of permutations, Europ. J. Combinatorics 24 (2003), 881-890.
Coherent configurations, association schemes, and permutation groups, pp. 55-71 in Groups, Combinatorics and Geometry (ed. A. A. Ivanov, M. W. Liebeck and J. Saxl), World Scientific, Singapore, 2003.
(with S. Majid) Braided line and counting fixed points of GL(d,F_q), Communications in Algebra 31 (2003), 2003-2013.
(with P. P. Alejandro and R. A. Bailey) Association schemes and permutation groups, Discrete Math. 266 (2003), 47-67.
Multi-letter Youden rectangles from quadratic forms, Discrete Math. 266 (2003), 143-151.
(editor) Problems from the eighteenth British Combinatorial Conference, Discrete Math. 266 (2003), 441-451.
Book review: Four Colours Suffice: How the Map Problem was Solved by Robin Wilson, London Math. Soc. Newsletter 315 (2003), 25-26.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2002:

(with Philippe Cara) Independent generating sets and geometries for symmetric groups, J. Algebra 258 (2002), 641-650; doi: 10.1016/S0021-8693(02)00550-1
Homogeneous permutations, Electronic J. Combinatorics 9(2) (2002), #R2 (9pp).
Permutations, pp. 205-239 in Paul Erdős and his Mathematics, Vol. II (ed. G. Halász, L. Lovász, M. Simonovits and V. T. Sós), Bolyai Society Mathematical Studies 11, Springer, Berlin, 2002.
(Note: A Web page gives further developments on the problems in this paper.)
(with Michael Giudici, Gareth A. Jones, William M. Kantor, Mikhail H. Klin, Dragan Marusic and Lewis A. Nowitz) Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.
(with Dudley Stark) A prolific construction of graphs with the n-e.c. property, Electronic J. Combinatorics 9(1) (2002), #R31 (12pp).
Permutation groups, pp. 86-89 in The Concise Handbook of Algebra (ed. A. V. Mikhalev and G. F. Pilz), Kluwer, Dordrecht, 2002.
(with Anthony Bonato, Dejan Delic and Stéphan Thomassé) Generalized pigeonhole properties of graphs and oriented graphs, European J. Combinatorics 23 (2002), 257-274.
(with Bridget S. Webb) What is an infinite design?, J. Combinatorial Design 10 (2002), 79-91.
Cycle index, weight enumerator and Tutte polynomial, Electronic J. Combinatorics 9(1) (2002), #N2 (10pp).
Book review: Number Theoretic Density and Logical Limit Laws by Stanley M. Burris, in Bull. London Math. Soc. 34 (2002), 243-244.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2001:

The random graph revisited, in European Congress of Mathematics, Barcelona, July 10-14, 2000, Volume II (ed. C. Casacuberta, R. M. Miró-Roig, J. Verdera and S. Xambó-Descamps), Birkhäuser, Basel, 2001, pp. 267-274.
(with Wilfrid Hodges) Some combinatorics of imperfect information, J. Symbolic Logic 66 (2001), 673-684.
Permutation groups whose non-identity elements have k fixed points, J. Group Theory 4 (2001), 45-51.
Fixed points and cycles, pp. 49-60 in Finite Geometries: Proceedings of the Fourth Isle of Thorns Conference (ed. A. Blokhuis, J. W. P. Hirschfeld, D. Jungnickel and J. A. Thas), Kluwer, Boston, 2001.
(editor) Problems from the 17th British Combinatorial Conference, Discrete Math. 231 (2001), 469-478.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

2000:

(with A. Bonato and D. Delic) Tournaments and orders with the pigeonhole property, Canadian Math. Bull. 43 (2000), 397-405.
Some counting problems related to permutation groups, Discrete Math. 225 (2000), 77-92.
(with Csaba Szabó) Independence algebras, J. London Math. Soc. (2) 61 (2000), 321-334.
Homogeneous Cayley objects, European J. Combinatorics 21 (2000), 745-760.
(editor) Problems on discrete metric spaces, European J. Combinatorics 21 (2000), 831-838.
(with L. Babai) Automorphisms and enumeration of switching classes of tournaments, Electronic J. Combinatorics 7(1) (2000), article #R38.
Sequences realized by oligomorphic permutation groups, Journal of Integer Sequences 3 (2000), article 00.1.5.
(with J. P. Bell, E. A. Bender and L. B. Richmond) Asymptotics for the probability of connectedness and the distribution of number of components, Electronic J. Combinatorics 7(1) (2000), article #R33.
Book review: Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture by D. M. Bressoud, Proc. Edinburgh Math. Soc. 43 (2000), 665-666.

1969-1979		1980-1989			1990-1999		Current
2000	2001	2002	2003	2004	2005	2006	2007	2008	2009

My homepage

Peter J. Cameron
30 April 2009