کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5776818 | 1413642 | 2017 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem](/preview/png/5776818.png)
چکیده انگلیسی
This paper studies a special form of integer partition of n, where the target is to find a maximal partition P, with the maximum number of parts, that does not include any partition of f as its subset. Let Ï(f,n) denote the number of parts in P. We show that such a problem is closely related to the tiny-pan coin weighing problem where each pan of the balance scale can hold exactly one coin, thereby deriving exact bounds for Ï(f,n) in some of the cases. Furthermore, we show that Ï(f,n) is ultimately periodic as a function of n, so that the computation of Ï(f,n), and its corresponding maximal partition, can be sped up.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 340, Issue 6, June 2017, Pages 1397-1404
Journal: Discrete Mathematics - Volume 340, Issue 6, June 2017, Pages 1397-1404
نویسندگان
Te-Sheng Tan, Dai-Yang Wu, Wing-Kai Hon,