کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649192 | 1342445 | 2009 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Universal cycles of (n−1)(n−1)-partitions of an nn-set
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Universal cycles of (n−1)(n−1)-partitions of an nn-set Universal cycles of (n−1)(n−1)-partitions of an nn-set](/preview/png/4649192.png)
چکیده انگلیسی
In 1992 Chung, Diaconis and Graham generalized de Bruijn cycles to other combinatorial families with universal cycles . Universal cycles have been investigated for permutations, partitions, kk-partitions and kk-subsets. In 1990 Hurlbert proved that there exists at least one Ucycle of n−1n−1-partitions of an nn-set when nn is odd and conjectured that when nn is even, they do not exist. Herein we prove Hurlbert’s conjecture by establishing algebraic necessary and sufficient conditions for the existence of these Ucycles. We enumerate all such Ucycles for n≤13n≤13 and give a lower bound on the total number for all nn. Additionally we give ranking and unranking formulae. Finally we discuss the structures of the various solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 309, Issue 17, 6 September 2009, Pages 5332–5340
Journal: Discrete Mathematics - Volume 309, Issue 17, 6 September 2009, Pages 5332–5340
نویسندگان
Karel Casteels, Brett Stevens,