Salisbury Laboratories 408A
+1 (508) 8315000 x5330
BA State University of New York Potsdam 1986
MA State University of New York Potsdam 1986
PhD University of Waterloo 1992

Bill Martin's goal is to find mathematical research projects that lie between beautiful and powerful mathematical theory, on the one hand, and pressing technological applications, on the other. This effort requires one to keep abreast of both mathematical developments and applications in computer science and engineering. Professor Martin's mathematical research is in the area of algebraic combinatorics, where tools from linear and abstract algebra are applied to problems in discrete math. An association scheme is a collection of graphs, which give rise to a highly structured matrix algebra whose eigenspaces reveal information about these graphs and their substructures. The vertices of the graphs might, for example, be the set of all binary n-tuples in which case we have a tool for the study of error-correcting codes. In this and numerous other cases, by embedding unstructured configurations into well-structured ambient spaces, we obtain algebraic leverage over what are otherwise messy applied problems. Martin and co-authors have applied the theory of association schemes to the study of experimental designs, finite geometries, highly regular graphs, error-correcting codes, (t,m,s)-nets, and structures appearing in quantum information theory. Martin's current research activities are split across four areas. With Professor Berk Sunar and co-authors, Martin has investigated homomorphic encryption schemes, random number generators, and other ideas in cryptography. With his collaborators, he is carrying out research in quantum information,  obtaining results on quantum random walks, quantum error-correcting codes, quantum games, and mutually unbiased bases.  Finally, he also uses algebraic and combinatorial techniques to develop association scheme theory itself. In addition to these main activities, Professor Martin is interested in K-12 education, contributing to math clubs, competitions, summer camps, and high school curricular development.

Scholarly Work

Mixed block designs
Completely regular designs of strength one
``There are finitely many Q-polynomial association schemes with given first multiplicity at least three.'' (with Jason Williford). European Journal of Combinatorics 30, no. 3 (2009), pp. 698-704. DOI link:
`Width and dual width of subsets in polynomial association schemes.'' (with A. E. Brouwer, C. D. Godsil and J. Koolen) Journal of Combinatorial Theory, Series A 102 (2003), 255-271.
`Bounded, yet sufficient? How to determine whether limited side channel information enables key recovery'' (with T.~Eisenbarth and X.~Ye), (preprint) in: Smart Card Research and Advanced Applications Volume 8968 of the series Lecture Notes in Computer Science pp 215-232
``Imprimitive cometric association schemes: constructions and analysis.'' (with Mikhail Muzychuk and Jason Williford). Journal of Algebraic Combinatorics 25 no. 4 (2007), 399--415.