What is good mathematics?

Some personal thoughts and opinions on what ``good quality mathematics'' is, and whether one should try to define this term rigorously. As a case study, the story of Szemer\'edi's theorem is presented.Comment: 12 pages, no figures. To appear, Bull. Amer. Math. So

Of McKay Correspondence, Non-linear Sigma-model and Conformal Field Theory

The ubiquitous ADE classification has induced many proposals of often mysterious correspondences both in mathematics and physics. The mathematics side includes quiver theory and the McKay Correspondence which relates finite group representation theory to Lie algebras as well as crepant resolutions of Gorenstein singularities. On the physics side, we have the graph-theoretic classification of the modular invariants of WZW models, as well as the relation between the string theory nonlinear $\sigma$-models and Landau-Ginzburg orbifolds. We here propose a unification scheme which naturally incorporates all these correspondences of the ADE type in two complex dimensions. An intricate web of inter-relations is constructed, providing a possible guideline to establish new directions of research or alternate pathways to the standing problems in higher dimensions.Comment: 35 pages, 4 figures; minor corrections, comments on toric geometry and references adde

Motives: an introductory survey for physicists

We survey certain accessible aspects of Grothendieck's theory of motives in arithmetic algebraic geometry for mathematical physicists, focussing on areas that have recently found applications in quantum field theory. An appendix (by Matilde Marcolli) sketches further connections between motivic theory and theoretical physics.Comment: LaTeX 35 pages, article by Abhijnan Rej with an appendix by M.Marcolli. Version II/Final: cosmetic changes to bibliography, added a small subsection on triangulated categories to section 6. Accepted for publication in the MPIM-Bonn "Renormalization, combinatorics and physics" proceedings volum

An approximate version of Sidorenko's conjecture

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. This conjecture also has an equivalent analytic form and has connections to a broad range of topics, such as matrix theory, Markov chains, graph limits, and quasirandomness. Here we prove the conjecture if H has a vertex complete to the other part, and deduce an approximate version of the conjecture for all H. Furthermore, for a large class of bipartite graphs, we prove a stronger stability result which answers a question of Chung, Graham, and Wilson on quasirandomness for these graphs.Comment: 12 page

The area of cyclic polygons: Recent progress on Robbins' Conjectures

In his works [R1,R2] David Robbins proposed several interrelated conjectures on the area of the polygons inscribed in a circle as an algebraic function of its sides. Most recently, these conjectures have been established in the course of several independent investigations. In this note we give an informal outline of these developments.Comment: To appear in Advances Applied Math. (special issue in memory of David Robbins

Sum-of-squares proofs and the quest toward optimal algorithms

In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this tailoring is not necessary and that a single efficient algorithm could achieve best possible guarantees for a wide range of different problems. The Unique Games Conjecture (UGC) is a tantalizing conjecture in computational complexity, which, if true, will shed light on the complexity of a great many problems. In particular this conjecture predicts that a single concrete algorithm provides optimal guarantees among all efficient algorithms for a large class of computational problems. The Sum-of-Squares (SOS) method is a general approach for solving systems of polynomial constraints. This approach is studied in several scientific disciplines, including real algebraic geometry, proof complexity, control theory, and mathematical programming, and has found applications in fields as diverse as quantum information theory, formal verification, game theory and many others. We survey some connections that were recently uncovered between the Unique Games Conjecture and the Sum-of-Squares method. In particular, we discuss new tools to rigorously bound the running time of the SOS method for obtaining approximate solutions to hard optimization problems, and how these tools give the potential for the sum-of-squares method to provide new guarantees for many problems of interest, and possibly to even refute the UGC.Comment: Survey. To appear in proceedings of ICM 201