Ross Hall, Room 202
1000 E. University Ave.
Laramie, WY 82071
Research interests: algebraic graph theory, finite geometries, association schemes
Ross Hall 314
Department of Mathematics
University of Wyoming
Ph.D., U. Delaware, 2004
B.A., University of Pennsylvania, 1998
Jason Williford’s mathematical interests center around the interplay between algebra, finite geometry and combinatorics. Association schemes and coherent configurations are generalizations of permutation groups that provide a framework in which this interplay is quite rich. Recently, he has focused on generalizing the necessary conditions for existence and subset bounds of association schemes to coherent configurations. He also studies extremal problems in graph theory that can be approached using constructions from finite fields and geometries.
S. A. Hobart, J. Williford, 2012, The independence number for polarity graphs of even order planes, J. Algebraic Combin. DOI: 10.1007/s10801-012-0392-y.
T. A.Terlep, J. Williford, 2012 “Graphs from Generalized Kac-Moody Algebras”, Siam Journal on Discrete Math. 26, no. 3, 1112-1120.
T. Penttila, J. Williford, 2011, “New examples of Q-polynomial Association Schemes”, Journal of Combinatorial Theory Series A 118, no. 2, 502—509.
W.J. Martin, J. Williford, 2009, “There are finitely many Q-polynomial association schemes of given first multiplicity at least three,” European Journal of Combinatorics 30, 698—704.
E. Moorhouse and J. Williford, 2008, “Embedding Finite Partial Linear Spaces in Finite Translation Nets,” Journal of Geometry 91, 73—83.