欢迎光临!
您现在所在的位置:首页 >> 通知公告 & 学术信息
学术信息
SEMINARS
Up and down in a tree
时间  Datetime
2019-05-24 11:00 — 12:00 
地点  Venue
630
报告人  Speaker
祝隐峰
单位  Affiliation
上海交通大学
邀请人  Host
Combinatorics Seminar
报告摘要  Abstract

Let (V,2V,P) be a discrete probability space. Consider a rooted tree T with vertex set V and root r. A subset D of V is called T-down if d∈D implies that all the vertices which do not lie in the same component of T−d with r fall into D. For every positive integer k, we show that there is either a set U such that P(U)≥12k−1 and U induces a path with r as one endpoint, or there are k disjoint T-down subsets D1,…,Dk such that P(D1)≥?≥P(Dk)≥12k−1. Related results and questions will also be discussed.

Ongoing joint work with Yaokun Wu.