Denys Bulavka, The Typical Algebraic Shifting of Graphs and Surfaces

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 numbers of the graph.

Next, for any given compact connected Riemannian surface S, sample n points independently at random according to the volume measure, and consider the resulted a.a.s. unique Delaunay triangulation. We prove that a.a.s. its exterior algebraic shifting is an explicit shifted complex depending only on n and the Euler genus of S, and in particular is area-rigid. In both results the expected shifted complex is a homology lex-segment complex, a notion we define combinatorially and characterize numerically à la Björner-Kalai.

As a tool to prove the result on surfaces, we prove a universality result on edge contractions: for every fixed surface triangulation K, every dense enough point set in the surface yields a Delaunay triangulation that edge contracts to K.

This talk is based on joint works with Eran Nevo and Yuval Peled.

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

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 the size of a maximal uniform family of pairwise-intersecting faces. Holroyd and Talbot, and Borg conjectured that the same phenomena as in the classical case (i.e., the simplex) occurs: there is a maximal size pairwise-intersecting family with all its faces having some common vertex. Under stronger hypothesis, they also conjectured that if a family attains such bound then its members must have a common vertex. In this talk I will present some progress towards the characterization of the maximal families. Concretely I will show that the conjecture is true for near-cones of sufficiently high depth. In particular, this implies that the characterization of maximal families holds for, for example, the independence complex of a chordal graph with an isolated vertex as well as the independence complex of a (large enough) disjoint union of graphs with at least one isolated vertex. Under stronger hypothesis, i.e., more isolated vertices, we also recover a stability theorem.

This talk is based on a joint work with Russ Woodroofe.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.