Jonathan Jedwab's Selected Presentations

Souteastern Conference 2007
38th Southeastern Conference, 2007
(photo by Jeff Locke)

Plenary Addresses

2017:   IPM Combinatorics and Computing Conference 2017, Tehran, Iran. “A strong external difference family with more than two subsets”.

2016:   Network Coding and Designs, Dubrovnik, Croatia. “How many mutually unbiased bases can exist in complex space of dimension d?”

2015:   39th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Brisbane, Australia. “2048 ideas for turning combinatorial research into a game”.

2015:   ALCOMA 15 — Algebraic Combinatorics and Applications, Banz, Germany. “Constructions of complex equiangular lines”.

2014:   Workshop on Algebraic Design Theory and Hadamard Matrices, Lethbridge, AB. “Hadamard matrices and complex equiangular lines”.

2014:   Combinatorics 2014, Gaeta, Italy. “A survey of complex equiangular lines”.

2013:   International Workshop on Finite Fields Constructions of Combinatorial Arrays, Florianópolis, Brazil. “The structure of Costas arrays”.

2011:   13th IMA International Conference on Cryptography and Coding, Oxford, United Kingdom. “Emerging methods in the analysis of aperiodic autocorrelations”.

2011:   Algebraic Combinatorics: in memory of Bob Liebler, Fort Collins, CO. “Emerging methods in the analysis of aperiodic autocorrelations”.

2011:   Finite Geometries 3rd Irsee Conference, Irsee, Germany. “The asymptotic merit factor of binary sequences”.

2009:   2009 Colloquium on Combinatorics, Magdeburg, Germany. “A survey of Golay complementary sequences”.

2009:   6th Prairie Discrete Mathematics Workshop, Kelowna, BC. “New constructions of Golay complementary sequences”.

2009:   6th International Workshop on Coding and Cryptography, Lofthus, Norway. “New constructions of Golay complementary sequences”.

2007:   14th Canadian Undergraduate Mathematics Conference, Vancouver, BC. “Two summers of undergraduate research on the peak sidelobe level problem”.

2007:   8th International Conference on Finite Fields and their Applications, Melbourne, Australia. “What can be used instead of a Barker sequence”.

2007:   International Workshop on Combinatorics 2007, Yokohama and Kyoto, Japan. “Golay complementary sequences: a multi-dimensional approach”.

2007:   38th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL. “Written on a torus or on a cylinder? An elementary proof of the Barker array conjecture”.

2007:   38th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL. “Simplification through generalisation: Constructing and enumerating Golay sequences via Golay arrays”.

2004:   Sequences and their Applications 2004, Seoul, South Korea. “A survey of the merit factor problem for binary sequences”.

2003:   Combinatorial Design Theory Research Workshop, DIMACS Connect Institute, Piscataway, NJ. “Designing the IEEE 802.12 transmission code”.

2001:   Discrete Mathematics and its Industrial Applications, Capri, Italy. “Combinatorial design theory and the IEEE 802.12 transmission code”.

1994:   24th Manitoba Conference on Combinatorial Mathematics and Combinatorial Computing, Winnipeg, MB. “Recent results and open questions in difference sets”.

Invited Presentations

2017:   Special Session on Finite Algebraic Combinatorics and Applications, 2nd Mathematical Congress of the Americas, Montreal, QB. “Costas cubes”.

2017:   Special Session on Theory and Application of Finite Fields, 2nd Mathematical Congress of the Americas, Montreal, QB. “A strong external difference family with more than two subsets”.

2015:   Public lecture to mark 150th birthday of Jacques Hadamard, University of Queensland, Brisbane, Australia. “What is a research mathematician?”

2015:   22nd Coast Combinatorics Conference, Kailua-Kona, HI. “Complex equiangular lines and combinatorial designs”.

2014:   Antalya Algebra Days XVI, Antalya, Turkey. “The structure of Costas arrays”.

2012:   RICAM Workshop on Finite Fields and Their Applications: Character Sums and Polynomials, Strobl, Austria. “3-phase Golay sequence triads”.

2010:   Presentation and panel discussion, CMS Winter Meeting, Vancouver, BC. “The hiring process”.

2008:   Difference Sets Workshop, Houston, TX. “Beyond difference sets: aperiodic autocorrelation properties of sequences and arrays”.

2007:   Core Session on Finite Combinatorics, CMS-MITACS Joint Conference 2007, Winnipeg, MB. “Bounds on the growth rate of the peak sidelobe level of binary sequences”.

2006:   Ottawa-Carleton Discrete Mathematics Workshop, Carleton University, ON. “Written on a torus or on a cylinder? An elementary proof of the Barker array conjecture”.

2006:   Presentation and panel discussion, PIMS Changing the Culture 2006: Teaching Mathematics for Understanding, Simon Fraser University, BC. “Obstacles to understanding”.

2006:   Invited lecture to mark the initiation of a Ph.D. program in the Faculty of Science, University of Lethbridge, AB. “Written on a torus or on a cylinder? An elementary proof of the Barker array conjecture”.

2005:   Special Session on Combinatorics, CMS Winter Meeting, Victoria, BC. “Proof of the Barker array conjecture”.

2003:   Special Session on Combinatorics, CMS Winter Meeting, Vancouver, BC. “Constructing binary sequences with merit factor greater than 6.34”.

2002:   Gaines public lecture, University of Richmond, VA. “ ‘Only a student would try that’: How to construct binary sequences with merit factor greater than 6.34”.

2002:   Gaines public lecture, University of Richmond, VA. “Career planning for Math and Computer Science majors and minors”.

2002:   Combinatorial Potlatch, University of Puget Sound, WA. “Combinatorial design theory and the IEEE 802.12 transmission code”.

2001:   International Meeting on Finite Geometries, Oberwolfach, Germany. “Designing the IEEE 802.12 transmission code”.

2001:   18th British Combinatorial Conference, University of Sussex, United Kingdom. “Opportunities for combinatorics graduates in industry”.

2000:   MSRI Workshop on Emerging Applications of Combinatorial Designs, Berkeley, CA. “Two applications of combinatorial design theory”.

2000:   MSRI-Evans public lecture, MSRI Workshop on Emerging Applications of Combinatorial Designs, University of California, Berkeley, CA. “Combinatorial design theory in an industrial research lab”.

2000:   Combinatorics Colloquium, University of Reading, United Kingdom. “Combinatorics and digital communication”.

1998:   International Meeting on Designs and Codes, Oberwolfach, Germany. “Golay complementary sequences and Reed-Muller codes: an unexpected connection”.

1997:   Open University Colloquium on Combinatorial Designs and their Applications, Milton Keynes, United Kingdom. “Recent developments in difference sets”.

1995:   R.C. Bose Memorial Conference on Statistical Design and Related Combinatorics, Fort Collins, CO. “A recursive unifying construction for difference sets”.

1994:   Special Session on Codes and Designs, AMS Sectional Meeting, Richmond, VA. “Incompatible difference set contractions”.

1992:   Special Session on Measurements for Network Control, Planning and Optimization, 2nd ORSA Telecommunications Conference, Boca Raton, FL. “Traffic estimation for the largest sources on a network, using packet sampling with limited storage”.

1992:   Special Session on Designs and Codes, AMS Joint Mathematics Meeting, Baltimore, MD. “There is no (324, 153, 72)-difference set in ℤ22 × ℤ32 × ℤ9  or  ℤ4 × ℤ32 × ℤ9”.

Presentations to International Industry Standards Bodies

1997:   ETSI BRAN Working Group 3 (Hiperlan Type 2), London, United Kingdom. “Options for variable rate coding in OFDM using binary, quaternary and octary modulation”.

1993:   IEEE 802.3 Higher Speed Study Group, Boston, MA. “100Base-VG packet format”.

1993:   IEEE 802.3 Higher Speed Study Group, Baltimore, MD. “IEEE 802 functional requirement”.

1993:   IEEE 802.3 Higher Speed Study Group, Santa Clara, CA. “Error detection in 100Base-VG”.