کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
419889 | 683871 | 2008 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Size of downsets in the pushing order and a problem of Berlekamp
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The shifting technique is a useful tool in extremal set theory. It was successfully used and developed by Levon Khachatrian to obtain many significant results. The shifting operation also referred to as pushing gives rise to a partial order called pushing order. Here we consider the problem of determination of the size of special downsets in this order. For the analysis, the pushing order will be expressed isomorphically in terms of lattice paths and of majorization of sequences. In the case that the sequences under consideration are periodic the generating function for the numbers arising in an old combinatorial problem due to Berlekamp will be determined.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 156, Issue 9, 1 May 2008, Pages 1560–1566
Journal: Discrete Applied Mathematics - Volume 156, Issue 9, 1 May 2008, Pages 1560–1566
نویسندگان
Ulrich Tamm,