معرفی
Brant Jones is a Professor of Pure Mathematics at James Madison University (JMU), where he has been since 2010. He earned his PhD in Mathematics from the University of Washington in 2007 and held a VIGRE Fellowship at the University of California, Davis. His research focuses on combinatorics, particularly games, algorithms, algebraic structures, and enumerative combinatorics, often involving computational tools. He has mentored 28 undergraduate students in research projects and contributed to software libraries like liberiksson for Coxeter group computations. Jones has been awarded NSF grants for JMU's Research Experiences for Undergraduates (REU) program and led workshops at ICERM and AIM. His work has been cited by Don Knuth in The Art of Computer Programming.
Education: PhD in Mathematics, University of Washington (2007); Postdoctoral Fellowship at UC Davis (2007–2010).
Research Interests: Combinatorial game theory, algebraic structures, enumerative combinatorics, and reflection group representation theory. He frequently uses programming to aid his research and has experience in software engineering.
Publications: Over 20 peer-reviewed articles, including works on games of best choice, Kazhdan-Lusztig polynomials, and combinatorial enumeration. Recent work includes collaborations on core partitions and affine permutation patterns.
Awards/Grants: NSF REU funding (2017–2023), REUF workshop leadership (2019), citations in The Art of Computer Programming (2021).
Teaching: Courses in discrete mathematics, abstract algebra, calculus, and combinatorics. Coordinates JMU's Putnam Competition team.
Software Contributions: Developed liberiksson for Coxeter group calculations and contributed to Sage's combinatorics modules.
