• Denys Bulavka, Strict Erdős-Ko-Rado Theorems for Simplicial Complexes

    Room B332 IBS (기초과학연구원)

    The now classical theorem of Erdős, Ko and Rado establishes the size of a maximal uniform family of pairwise-intersecting sets as well as a characterization of the families attaining such upper bound. One natural extension of this theorem is that of restricting the possiblechoices for the sets. That is, given a simplicial complex, what is …

  • Denys Bulavka, The Typical Algebraic Shifting of Graphs and Surfaces

    Room B332 IBS (기초과학연구원)

    We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform refinement of any given graph, we show that asymptotically almost-surely (a.a.s.) its exterior algebraic shifting is an explicit shifted graph depending only on the number of vertices and the Betti …