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

What if instead of defining a mesh as a series of vertices and edges in a 3D space, you could describe it as a single function? The easiest function would return the signed distance to the closest ...

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

Most engineering labs have digital oscilloscopes, but many engineers don’t fully explore their features. Among the more interesting features of a digital oscilloscope is its math channel, which can ...

Mathematicians used “magic functions” to prove that two highly symmetric lattices solve a myriad of problems in eight- and 24-dimensional space. The points could be an infinite collection of electrons ...

The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate ...