2014/11/19 陳宏賓研究員專題演講
演講者：陳宏賓 研究員
單 位：中央研究院數學研究所
日 期：2014年11月19日（星期三） 14:30
地 點：國立高雄大學理學院408室
講 題：Bounding the Number of Elements in a P-Free Family
摘 要：
Burcsi and Nagy have recently proposed an interesting method for bounding the largest size of a P-free family of subsets of [n] for any poset P. A crucial step is to bound the maximum number of elements in the intersection of a P-free family and a double chain. For any poset P they gave an upper bound which is tight in the sense that there are infinitely many P attaining the bound. An interesting problem raises naturally that whether there is an efficient algorithm to determine the maximum number for any poset P. It is still unknown whether the problem is NP or not. In this talk, I will give an improved upper bound by proposing an efficient algorithm.
The talk is based on a joint work, which is still running, with Fei-Huang Chang, Jun-Yi Guo and Wei-Tian Li.
演講者:
陳宏賓 研究員
講題:
Bounding the Number of Elements in a P-Free Family
演講日期:
2014-11-19