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.

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

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

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

We investigate the pointwise well-posedness of optimization problems for locally convex cone-valued functions and establish some relations between the kinds of well-posedness. Via the neighborhoods ...

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

Logarithmic convexity type continuous dependence results for discrete harmonic functions defined as solutions of the standard $C^0$ piecewise-linear approximation to ...