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

A. Laradji, A. Umar

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)269-283
Number of pages15
JournalJournal of Difference Equations and Applications
Volume21
Issue number3
DOIs
Publication statusPublished - Mar 4 2015

Fingerprint

Equivalence classes
Semigroup

Keywords

  • asymptotic behaviour
  • generating function
  • nilpotent transformation
  • order-preserving and order-reversing subpermutations
  • recurrence relation

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics
  • Analysis

Cite this

Combinatorial results for semigroups of order-preserving or order-reversing subpermutations. / Laradji, A.; Umar, A.

In: Journal of Difference Equations and Applications, Vol. 21, No. 3, 04.03.2015, p. 269-283.

Research output: Contribution to journalArticle

@article{8592100ebbae4d68a515b886cbc39724,
title = "Combinatorial results for semigroups of order-preserving or order-reversing subpermutations",
abstract = "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.",
keywords = "asymptotic behaviour, generating function, nilpotent transformation, order-preserving and order-reversing subpermutations, recurrence relation",
author = "A. Laradji and A. Umar",
year = "2015",
month = "3",
day = "4",
doi = "10.1080/10236198.2015.1005080",
language = "English",
volume = "21",
pages = "269--283",
journal = "Journal of Difference Equations and Applications",
issn = "1023-6198",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

TY - JOUR

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

AU - Laradji, A.

AU - Umar, A.

PY - 2015/3/4

Y1 - 2015/3/4

N2 - 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.

AB - 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.

KW - asymptotic behaviour

KW - generating function

KW - nilpotent transformation

KW - order-preserving and order-reversing subpermutations

KW - recurrence relation

UR - http://www.scopus.com/inward/record.url?scp=84924337176&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924337176&partnerID=8YFLogxK

U2 - 10.1080/10236198.2015.1005080

DO - 10.1080/10236198.2015.1005080

M3 - Article

AN - SCOPUS:84924337176

VL - 21

SP - 269

EP - 283

JO - Journal of Difference Equations and Applications

JF - Journal of Difference Equations and Applications

SN - 1023-6198

IS - 3

ER -