Mathematical Theory of Computational Complexity (see for example "An Introduction to Kolmogorov Complexity" by Paul Vitányi).
Convex, Integer, Combinatorial and Discrete Optimization.
Birch and Swinnerton-Dyer conjecture: https://www.claymath.org/wp-content/uploads/2022/05/birchswin.pdf
