Monthly Archives: September 2019

Alef’s corner: Bicycles and the Art of Planar Random Maps

The artist behind Alef’s corner has a few mathematical designs and here are two new ones. (See Alef’s  website offering over 100 T-shirt designs.)   which was used for the official T-shirt for Jean-François Le Gall’s birthday conference. See also … Continue reading

Posted in Art, Combinatorics, Geometry, Probability | Tagged | Leave a comment

Paul Balister, Béla Bollobás, Robert Morris, Julian Sahasrabudhe, and Marius Tiba: Flat polynomials exist!

Béla Bollobás and Paul Erdős at the University of Cambridge in 1990. Credit George Csicsery (from the 1993 film “N is a Number”) (source) (I thank Gady Kozma for telling me about the result.) An old problem from analysis with a … Continue reading

Posted in Analysis, Combinatorics | Tagged , , , , , | 1 Comment

Computer Science and its Impact on our Future

A couple weeks ago I told you about Avi Wigderson’s vision on the connections between the theory of computing and other areas of mathematics on the one hand and between computer science and other areas of science, technology and society … Continue reading

Posted in Academics, Computer Science and Optimization, Quantum, Updates | Tagged | 1 Comment

Richard Ehrenborg’s problem on spanning trees in bipartite graphs

Richard Ehrenborg with a polyhedron In the Problem session last Thursday in Oberwolfach, Steve Klee presented a beautiful problem of Richard Ehrenborg regarding the number of spanning trees in bipartite graphs. Let be a bipartite graph with vertices on one … Continue reading

Posted in Combinatorics, Open problems | Tagged | 3 Comments