This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...

The authors do not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and have disclosed no relevant affiliations beyond their ...

A course designed to allow students to simultaneously satisfy their LS requirements and take MATH 1001, a Core IMPACTS Mathematics course. This course is designed to support a student taking MATH 1001 ...

Mathematics has applications throughout the sciences and social sciences. It's also a subject with intrinsic intellectual and aesthetic interest. Mathematics draws much of its following and strength ...

Annals of Mathematics, Second Series, Vol. 160, No. 1 (Jul., 2004), pp. 185-236 (52 pages) In this paper we solve the subconvexity problem for Rankin-Selberg L ...

This is a preview. Log in through your library . Abstract A class of global Lyapunov functions is revisited and used to resolve a long-standing open problem on the uniqueness and global stability of ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...