ملخص
Consider an n-set, say Xn = {1,2,⋯, n}. An exponential generating function and recurrence relation for the number of subpermutations of Xn, whose orbits are of size at most k ≥ 0 are obtained. Similar results for the number of nilpotent subpermutations of nilpotency index at most k, and exactly k are also given, along with arithmetic and asypmtotic formulas for these numbers. 1 2.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 447-460 |
عدد الصفحات | 14 |
دورية | Ars Combinatoria |
مستوى الصوت | 109 |
حالة النشر | Published - أبريل 2013 |
ASJC Scopus subject areas
- ???subjectarea.asjc.2600.2600???