Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

Let Γ(X) denote the proper, lower semicontinuous, convex functions on a Banach space X, equipped with the completely metrizable topology of uniform convergence of distance functions on bounded sets.

This is a preview. Log in through your library . Abstract We derive sharp upper bounds for eigenvalues of the Laplacian under Neumann boundary conditions on convex domains with given diameter in ...

Bernhard Riemann was a man with a hypothesis. He was confident that it was true, probably. But he didn’t prove it. And attempts over the last century and a half by others to prove it have failed. A ...