Skip to content
Turn on more accessible mode
Turn off more accessible mode
Sign In
  • Confirmed Participants
  • Important Information
  • Photos
      • Program
      • Abstracts
      • Photo Albums
    • Outlook 365
    • post
    • phonebook
    • Academic Calendar 2022-23
    • Maps & Directions
    • Academic Openings
  • Students
  • Staff
  • Friends
  • Apply
  • Quick Links
    • Outlook 365
    • post
    • phonebook
    • Academic Calendar 2022-23
    • Maps & Directions
    • Academic Openings
Ben-Gurion University Skip to Home Page
Ben-Gurion University Skip to Home Page
ERC Workshop: Adventures
in Combinatorial Geometry
Support BGU Support
ERC Workshop: Adventures in Combinatorial Geometry
  • Confirmed Participants
  • Important Information
  • Photos
  • Previous Workshops
    • 2018 ERC Workshop: Geometric Transversals and Epsilon-Nets

      • Program
      • Abstracts
      • Photo Albums
 
Stop Replacing Pictures Start Replacing Pictures

ERC Workshop: Adventures in Combinatorial Geometry 

Geometric Transversals, Epsilon-Nets, and Ramsey

Ein-Gedi, on January 27—31, 2019

Program | Abstracts


​

Objectives:

 

Geometric Transversal Theory has long become a major area of Discrete Geometry, with strong connections to Linear Optimization and Algebraic Topology. The work on Helly-type Theorems led to deep quantitative problems whose study was spearheaded by Alon, Barany, Goodman, Pollack, Kalai, Katchalski, Kleitman, Lovasz, Wenger, and others. As has been discovered in late 1980s, the answers to several of these questions essentially rely on the existence of small-size Epsilon-nets.

The study of Epsilon-nets is related to a number of deep notions including Tverberg-type and geometric selection theorems, and hypergraph containers. In the past 10 years, significant advances and far-reaching generalizations in this connection have been done by Alon, Balogh and Solymosi, Pach and Tardos, Aronov, Ezra and Sharir, Bukh, Matoušek, and Nivasch, Gromov, Karasev, Wagner, and many others.

In the same time, we have witnessed remarkable progress by Fox, Pach, Suk, Toth, and others towards the closely related goal of understanding the Ramsey-theoretic properties of the graphs and hypergraphs that arise in combinatorial geometry (e.g., semi-algebraic hypergraphs, and graphs that represent intersections among Jordan arcs or convex sets).

We ask to capitalize on this momentum by bringing together researchers in such aspects of combinatorial geometry as Helly-type Theorems and transversal numbers of families of convex sets, Epsilon-nets, and geometric Ramsey-type and regularity theorems.

 

This is a second meeting which is organized as part of the 5-year project Combinatorial Aspects of Computational Geometry supported by the European Research Council (ERC).

The program begins on Sunday, January 27, 2019, when a bus/shuttle will leave Tel Aviv/Ben-Gurion Airport to spectacular Ein-Gedi resort, in close proximity to the Dead Sea and the famous Ein-Gedi natural reserve. The scientific part of the conference stretches over 4.5 days filled with talks, working sessions, and a local excursion. The program ends on Thursday afternoon when the participants will be taken back to Tel Aviv and/or Ben-Gurion Airport.  

 

 

​
ERC-Logo                  BGU-logo.png
                                                               The European Research Council (ERC)                                     Ben-Gurion University
                                                             Established by the European Commission                                         of the Negev
 
 
  • Facebook
  • Instagram
  • Telegram
  • YouTube
  • LinkedIn
  • טוויטר
  • Tiktok
Switchboard: 972-8-6461111
P.O.B. 653 Beer-Sheva
Counseling and Registration: 972-8-6461600
WhatsApp Counseling and Registration
Ben-Gurion University in Eilat: 08-6304518
© 2016 All Rights Reserved Ben-Gurion University of the Negev | Terms Of Use | Accessibility Statement | Privacy Statement

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies.