کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8901150 | 1631731 | 2018 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Set partitions avoiding k-crossing and k-nesting have been extensively studied from the aspects of both combinatorics and mathematical biology. By using the generating tree technique, the obstinate kernel method and Zeilberger's algorithm, Lin confirmed a conjecture due independently to the author and Martinez-Savage that asserts inversion sequences with no weakly decreasing subsequence of length 3 and enhanced 3-nonnesting partitions have the same cardinality. In this paper, we provide a bijective proof of this conjecture. Our bijection also enables us to provide a new bijective proof of a conjecture posed by Duncan and SteingrÃmsson, which was proved by the author via an intermediate structure of growth diagrams for 01-fillings of Ferrers shapes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 325, 15 May 2018, Pages 24-30
Journal: Applied Mathematics and Computation - Volume 325, 15 May 2018, Pages 24-30
نویسندگان
Sherry H.F. Yan,