Geometric Set Systems

Geometric Set Systems is a mathematical framework in discrete geometry that consists of a finite collection of geometric objects, such as points, lines, or convex sets, along with a family of subsets defined by their incidence or intersection patterns, distinguished from general set systems by the inherent geometric constraints governing membership and structure.

17

Publications

601

Citations

34

Authors

27

Institutions

Publications per year

2017–2026

1

Authors

34

  1. SS
    Shakhar Smorodinsky

    Tel Aviv University, Israel

    2 publications · 251 citations

    2

    h-index

  2. GE
    Guy Even

    Tel Aviv University, Israel

    2 publications · 251 citations

    2

    h-index

  3. JL
    Jiuqiang Liu

    Eastern Michigan University, United States

    2 publications · 33 citations

    2

    h-index

  4. ZL
    Zvi Lotker

    Ben-Gurion University of the Negev, Israel

    2 publications · 251 citations

    2

    h-index

  5. BC
    Bernard Chazelle

    Princeton University, United States

    2 publications · 37 citations

    2

    h-index

1–5 of 34

Venues

  1. Journal of Combinatorial Theory Series A

    3 publications · 59 citations

    3

    h-index

  2. SIAM Journal on Computing

    2 publications · 242 citations

    2

    h-index

  3. European Journal of Combinatorics

    1 publications · 18 citations

    1

    h-index

  4. Discrete Applied Mathematics

    1 publications · 20 citations

    1

    h-index

  5. Ukrainian Mathematical Journal

    1 publications · 29 citations

    1

    h-index

1–5