Robert Bailey's talks

Here is a list of talks that I have given (or will be giving soon), and links to slides, notes or abstracts, if available. (Some of the talks were "chalk-and-talk" seminars, for which no abstract needed to be provided.)

Date Location Title
30th January 2003 London Intercollegiate Postgraduate Seminar (LIPS), Imperial College  Distance-Transitive Graphs
23rd February 2003   Combinatorics Study Group, QMUL Decoding the Mathieu Group M12
27th March 2003 14th Postgraduate Combinatorial Conference, Nottingham   Distinct Weight Codes
4th July 2003 19th British Combinatorial Conference, Bangor (slides) Decoding the Mathieu Group M12
28th July 2003 1st NEPGPMW, University of York (slides) Decoding the Mathieu Group M12
13th November 2003   QuIPS (Queen Mary Internal Postgraduate Seminar), QMUL  Permutation groups, error-correcting codes and covering designs
27th November 2003   QuIPS, QMUL Structure of finite fields
13th February 2004
20th February 2004 Combinatorics Study Group, QMUL (notes) Distance-transitive (and distance-regular) graphs (3 parts!)
5th March 2004
25th March 2004 6th Postgraduate Group Theory Conference, Warwick Permutation groups, error-correcting codes and covering designs
21st April 2004 15th Postgraduate Combinatorial Conference, QMUL Permutation groups, error-correcting codes and covering designs
28th June 2004 2nd PoPMiNE, Newcastle (slides) Error-correcting codes from permutation groups
7th October 2004 QuIPS, QMUL The Legend of the Lost Thesis
3rd December 2004 Combinatorics Study Group, QMUL 13/8
17th January 2005 Pure Mathematics Seminar, QMUL Error-correcting codes from permutation groups
21st March 2005 16th Postgraduate Combinatorial Conference, Oxford (slides) Primitive Elements and Uncoverings
1st April 2005 Combinatorics Study Group, QMUL (slides) Permutation groups, error-correcting codes and uncoverings
6th April 2005 ALCOMA05, Thurnau, Germany (slides) Permutation groups, error-correcting codes and uncoverings
13th July 2005 20th British Combinatorial Conference, Durham (slides) Permutation groups, error-correcting codes and uncoverings
5th August 2005 Groups St Andrews in St Andrews The "single orbit conjecture" for uncoverings-by-bases
17th November 2005 QuIPS, QMUL Graph decompositions and uncoverings
12th May 2006 Ottawa-Carleton Discrete Mathematics Day(s),
Carleton University, Ottawa
(slides) Error-correcting codes from permutation groups
16th May 2006 Workshop on Covering Arrays,
Carleton University, Ottawa
(slides) Uncoverings-by-bases for permutation groups and matroids
6th November 2006 Pure Mathematics Seminar, QMUL Distance enumerators for permutation groups
30th March 2007 Combinatorics Study Group, QMUL Some cases of the single-orbit conjecture
12th July 2007 21st British Combinatorial Conference, Reading (slides) Uncoverings-by-bases for graphic matroids
23rd October 2007 Ottawa-Carleton Algebra Seminar On the single-orbit conjecture for uncoverings-by-bases
2nd November 2007 Ottawa-Carleton Combinatorics & Optimization Seminar Coverings and uncoverings on structures
17th April 2008 Caltech Combinatorics Seminar, California Institute of Technology      Permutation groups, codes and the single-orbit conjecture
1st May 2008 Ottawa Mathematics Conference, University of Ottawa (slides) Distance enumerators of permutation groups
11th May 2008 Ottawa-Carleton Graph Theory Workshop, Carleton University (slides) Uncoverings-by-bases for graphic matroids
23rd May 2008 Ontario Combinatorics Workshop, University of Waterloo (slides) Hamiltonian decompositions of complete k-uniform hypergraphs
23rd June 2008 Combinatorics 2008, Costermano, Italy (slides) Hamiltonian decompositions of complete k-uniform hypergraphs
14th November 2008 Ottawa–Carleton Discrete Mathematics Seminar Base size, metric dimension and other stories
6th December 2008     Canadian Mathematical Society Winter Meeting, Ottawa
(session on "Coding and Cryptography")
(slides) Distance enumerators of permutation groups
8th January 2009 Groups, Combinatorics and Computation 2009, University of Western Australia     (slides) Separation defects, bases and the single-orbit conjecture
20th January 2009 Pure Mathematics Seminar, University of New South Wales Packing spanning trees in graphs and bases in matroids
28th January 2009 Two-day Algebra Workshop, University of Auckland Base size, metric dimension and other stories
4th February 2009 Discrete Math Seminar, Portland State University Packing spanning trees in graphs and bases in matroids
10th February 2009 Discrete Math Seminar, Simon Fraser University Packing spanning trees in graphs and bases in matroids
20th February 2009 Department of Mathematics and Statistics Colloquium, University of Regina Base size, metric dimension and other stories
6th March 2009 Combinatorics & Optimization Seminar, Carleton Packing spanning trees in graphs and bases in matroids
27th April 2009 AMS Sectional Meeting (session on association schemes), Worcester Polytechnic Institute   (slides) Base size, metric dimension and other stories
23rd May 2009 Ottawa–Carleton Discrete Mathematics Days, University of Ottawa. (slides) Bases for automorphism groups of graphs
28th May 2009 CanaDAM 2009, CRM, Montreal (slides) On packing bases in matroids
7th June 2009 Canadian Mathematical Society Summer Meeting, St. John's
(session on "Algebraic Combinatorics")
(slides) Metric dimension of distance-regular graphs
6th July 2009 22nd British Combinatorial Conference, St Andrews (slides) Metric dimension of distance-regular graphs
2nd November 2009 Mathematics seminar, University of Winnipeg Metric dimension and permutation groups
27th November 2009 Department of Mathematics and Statistics Colloquium, University of Regina Hamiltonian decompositions of hypergraphs
15th February 2010 Combinatorics Seminar, Memorial University of Newfoundland Hamiltonian decompositions of hypergraphs
24th March 2010 Combinatorics, Groups, Algorithms, and Complexity 2010, Ohio State University (slides) Metric dimension of distance-regular graphs
15th May 2010 Ottawa–Carleton Discrete Mathematics Days 2010, Carleton University (slides) Generalized covering designs and clique coverings
4th June 2010 Combinatorics Study Group, Queen Mary, University of London Generalised covering designs and clique coverings
28th June 2010 Combinatorics 2010, Verbania, Italy (slides) Generalized covering designs
4th December 2010 Canadian Mathematical Society Winter Meeting, Vancouver
(session on "Theory and Applications of Sequences and Arrays")
(slides) Generalized covering and packing designs
11th March 2011 Department of Mathematics and Statistics Colloquium, University of Regina Resolving sets in graphs in certain association schemes
30th April 2011 Prairie Network for Research in the Mathematical Sciences, University of Regina (slides) The metric dimension problem in geometry, combinatorics and algebra
7th May 2011 Ontario Combinatorics Workshop, Ryerson University (slides) A matrix method for resolving sets in Johnson graphs
13th May 2011 Ottawa-Carleton Discrete Mathematics Days 2011, University of Ottawa (slides) Resolving sets for incidence graphs (without the infamous mistake)
1 June 2011 CanaDAM 2011, University of Victoria (slides) A matrix method for resolving sets in Johnson graphs
3 June 2011 CanaDAM 2011, University of Victoria (slides) Generalized covering designs as hypergraph covers
5 July 2011 23rd British Combinatorial Conference, University of Exeter (slides) Resolving sets for incidence graphs
19 July 2011 Graphs, Designs and Algebraic Combinatorics, University of Regina (slides) Recent (and not-so-recent) results on metric dimension of distance-regular graphs
1 August 2011 Algebra seminar, University of Auckland (slides) The metric dimension problem in geometry, algebra and combinatorics
12th December 2011 Canadian Mathematical Society Winter Meeting, Toronto
(session on "Designs, Factorizations & Coverings")
(slides) Some observations about covering arrays and VC-dimension

Back to Robert Bailey's homepage

Page last updated 15 December 2011.