کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
436369 689996 2008 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Combinatorial Gray codes for classes of pattern avoiding permutations
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Combinatorial Gray codes for classes of pattern avoiding permutations
چکیده انگلیسی

The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, large Schröder, Pell, even-index Fibonacci numbers and the central binomial coefficients. We thus provide Gray codes for the set of all permutations of {1,…,n} avoiding the pattern τ for all τ∈S3 and the Gray codes we obtain have distances 4 or 5.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 396, Issues 1–3, 10 May 2008, Pages 35-49