معرفی
Mohamed Omar is a Full Professor in the Department of Mathematics and Statistics at York University, located in Toronto, Canada. His research focuses on Discrete Mathematics, Combinatorics, and Pure Mathematics, with a particular interest in the application of polynomials to discrete structures. He holds a Ph.D. from the University of California, Davis, and an M.Sc. from the University of Waterloo.
His notable awards include the AMS Claytor-Gilmer Fellowship, Karen EDGE Fellowship, and Henry L. Alder Award. His work spans algebraic combinatorics, graph theory, and neural coding, with contributions to permutation patterns, polynomial applications, and discrete geometry.
Recent research highlights include studies on permutation descent words, partition lattice analysis, and sparse neural codes. He has authored books such as Graph Theory You Need Before Undergrad Research and Number Theory Toward RSA Cryptography, reflecting his commitment to undergraduate education and mathematical exposition.
