Jason Williford, Ph.D., University of Delaware Ross Hall 314 |

**Education**

Ph.D. Mathematics, University of Delaware, 2004

B.A. Mathematics, University of Pennsylvania, 1998

**About Dr. Williford**

Jason Williford joined the University of Wyoming faculty in 2009. He came to the University of Wyoming from the University of Colorado at Denver.

His 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.

**Representative publications**

- S. A. Hobart and J. Williford, The independence number for polarity graphs of even order planes, J. Algebraic Combin., (2012). DOI: 10.1007/s10801-012-0392-y.
- T. A.Terlep and J. Williford, Graphs from Generalized Kac-Moody Algebras, SIAM Journal on Discrete Math., 26/3 (2012), pp. 1112-1120.
- T. Penttila and J. Williford, New examples of Q-polynomial Association Schemes, Journal of Combinatorial Theory Series A, 118/2 (2011), pp. 502-509.
- W.J. Martin and J. Williford, There are finitely many Q-polynomial association schemes of given first multiplicity at least three, European Journal of Combinatorics, 30 (2009), pp. 698-704.
- E. Moorhouse and J. Williford, Embedding Finite Partial Linear Spaces in Finite Translation Nets, Journal of Geometry, 91 (2008), pp. 73-83.