کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8904830 | 1633758 | 2018 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Kleitman's conjecture about families of given size minimizing the number of k-chains
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This question was resolved for 2-chains by Kleitman in 1966, who showed that amongst families of size M in P(n), the number of 2-chains is minimized by a family whose sets are taken as close to the middle layer as possible. He also conjectured that the same conclusion should hold for all k, not just 2. The best result on this question is due to Das, Gan and Sudakov who showed that Kleitman's conjecture holds for families whose size is at most the size of the k+1 middle layers of P(n), provided kâ¤nâ6. Our main result is that for every fixed k and ε>0, if n is sufficiently large then Kleitman's conjecture holds for families of size at most (1âε)2n, thereby establishing Kleitman's conjecture asymptotically. Our proof is based on ideas of Kleitman and Das, Gan and Sudakov. Several open problems are also given.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Advances in Mathematics - Volume 330, 25 May 2018, Pages 229-252
Journal: Advances in Mathematics - Volume 330, 25 May 2018, Pages 229-252
نویسندگان
József Balogh, Adam Zsolt Wagner,