Ascent on Non-Deranged Permutation Group
DOI:
https://doi.org/10.57233/ijsgs.v4i2.100Keywords:
Ascent Numbers, Ascent set, non-deranged permutation Group, Ascent bottom, Ascent topAbstract
Some further theoretic properties of the scheme called non-deranged permutation Group, especially in relation to Ascent were identified and studied in this paper. This was done by first computations on this scheme using prime numbers. A recursion formula for generating the Ascent number, union of Ascent set, Ascent bottom sum and Ascent top sum was developed and used, these numbers were used to identify theoretic consequences.









