More Like this

1. Geometric Topology

   https://doi.org/10.4171/OWR/2015/3  

   Bridson, Martin; Löh, Clara; Schick, Thomas (January 2015, Oberwolfach Reports)
2. Geometric exponential integrators

   https://doi.org/10.1016/j.jcp.2019.01.005  

   Shen, Xuefeng; Leok, Melvin (April 2019, Journal of Computational Physics)
3. Betti Geometric Langlands

   Nadler, David; Ben-Zvi, David (January 2018, Algebraic geometry: Salt Lake City 2015, AMS Proceedings of symposia in pure mathematics)

   Introduces and surveys a Betti form of the geometric Langlands conjecture, parallel to the de Rham form developed by Beilinson-Drinfeld and Arinkin-Gaitsgory, and the Dolbeault form of Donagi-Pantev, and inspired by the work of Kapustin-Witten in supersymmetric gauge theory. 

   more » « less
4. Universal Geometric Graphs

   https://doi.org/10.1007/978-3-030-60440-0_14  

   Frati, Fabrizio; Hoffmann, Michael; Toth, Csaba D. (October 2020, Graph-Theoretic Concepts in Computer Science (WG 2020))

   null (Ed.)

   We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is universal for a class H of planar graphs if it contains an embedding, i.e., a crossing-free drawing, of every graph in H . Our main result is that there exists a geometric graph with n vertices and O(nlogn) edges that is universal for n-vertex forests; this extends to the geometric setting a well-known graph-theoretic result by Chung and Graham, which states that there exists an n-vertex graph with O(nlogn) edges that contains every n-vertex forest as a subgraph. Our O(nlogn) bound on the number of edges is asymptotically optimal. We also prove that, for every h>0 , every n-vertex convex geometric graph that is universal for the class of the n-vertex outerplanar graphs has Ωh(n2−1/h) edges; this almost matches the trivial O(n2) upper bound given by the n-vertex complete convex geometric graph. Finally, we prove that there is an n-vertex convex geometric graph with n vertices and O(nlogn) edges that is universal for n-vertex caterpillars. 

   more » « less
5. Private Geometric Median

   Haghifam, Mahdi; Steinke, Thomas; Ullman, Jonathan (December 2024, Neural and Information Processing Systems)