Ada Chan, Nomura algebra of Dita-type complex Hadamard matrices, in preparation.
Ada Chan, Spin models from generalized Hamming schemes, in preparation.
Ada Chan and C. D. Godsil, Type-II matrices and combinatorial structures, Combinatorica 30(2010), no. 1, 1--24. ps
Ada Chan and Rie Hosoya, On the association schemes of type-II matrices constructed on conference graphs, J. Algebraic Combinatorics 20 (2004), no. 3, 341--351. ps
Ada Chan, Jones pairs, Ph.D. Thesis, University of Waterloo, 2001
Ada Chan, Bounds on designs derived from Delsarte's inequalities, Master Thesis, University of Waterloo, 1995
Session on Combinatorics
CMS 2008 Winter Meeting, Ottawa, Canada,  December, 2008
Special Session on Association Schemes and related topics
AMS 2005 Fall Central Meeting, University of Nebraska - Lincoln, U.S.A.,  October, 2005
Algebraic Combinatorics Seminar, University of Waterloo, Canada,  April, 2005
Algebraic Combinatorics Seminar, University of Waterloo, Canada,  November, 2005
Information Mathematical Sciences Colloquium, Tohoku University, Japan,  July, 2004
Combinatorics Seminar, University of Wisconsin-Madison, U.S.A.,  November, 2003
Special Session on Association Schemes: 1973-2003
2003 AMS Fall Southeastern Section Meeting, University of North Carolina at Chapel Hill, U.S.A.,   October, 2003
Special Session on Association Schemes and Distance Regular Graphs
2002 AMS Spring Western Section Meeting, Portland State University, U.S.A.,   June, 2002
Kyushu University, Japan,  May 2002
Applied Algebra Seminar, York University, Canada,  April, 2002
Combinatorics Seminar, California Institute of Technology, U.S.A., February 2001
Faculty of Mathematics Graduate Student Conference, University of Waterloo, Canada,   June 2000
Management Science Seminar, Tilburg University, Netherlands,   September 1998
Algebraic Combinatorics Day, University of Toronto, Canada,   July 1998
Eleventh Ontario Combinatorics Workshop, Ryerson University, Canada,   May 1997
Algebraic combinatorics is my research area,
with the focus on Jones pairs, type-II matrices and
their relations to association schemes.
Association schemes encode combinatorial objects such as distance regular
graphs and symmetric designs. They can also be viewed as a generalization
of finite abelian groups.
Two families of association schemes, the Johnson schemes
and the Hamming schemes, have applications in the study of designs,
codes and orthogonal arrays.
My interest lies in the connections of association schemes with
coding theory, design theory, graph theory and knot theory.