Combinatorial results for semigroups of order-preserving or order-reversing subpermutations

A. Laradji*, A. Umar

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

3 اقتباسات (Scopus)

ملخص

Let (Formula presented.) For a partial one–one transformation (or subpermutation) (Formula presented.) of (Formula presented.) the following parameters are defined: the height (Formula presented.) , the waist (Formula presented.) , and the fix (Formula presented.). We compute the cardinalities of some equivalence classes defined by equalities of these parameters on (Formula presented.) and (Formula presented.) the semigroups of order-preserving and of order-preserving or order-reversing subpermutations of (Formula presented.) respectively. As a consequence, we obtain several formulae and generating functions for the number of nilpotents in (Formula presented.) and (Formula presented.). We also prove that, for large (Formula presented.) a randomly chosen order-preserving (resp. order-reversing) subpermutation of (Formula presented.) has probability (Formula presented.) (resp. (Formula presented.) ) of being nilpotent.

اللغة الأصليةEnglish
الصفحات (من إلى)269-283
عدد الصفحات15
دوريةJournal of Difference Equations and Applications
مستوى الصوت21
رقم الإصدار3
المعرِّفات الرقمية للأشياء
حالة النشرPublished - مارس 4 2015
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2603???
  • ???subjectarea.asjc.2600.2602???
  • ???subjectarea.asjc.2600.2604???

بصمة

أدرس بدقة موضوعات البحث “Combinatorial results for semigroups of order-preserving or order-reversing subpermutations'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا