Implementation of Aunu permutation patterns using computer algebra system: A computational approach

Abstract

Aunu permutation patterns are a class of (123) and (132) avoiding permutation patterns with special properties associated with succession and association schemes. These patterns have been used extensively in formulation of different mathematical structures such as groups, graphs and in a study of different algebraic schemes such as cyclic designs and circuit designs. This paper developed an implementation of the (123)-avoiding class using a computer algebra systems (MAPLE), thereby achieving a computational technique for generating the patterns involving larger prime numbers. This povides an improvement of the analytical techniques which have been used before now and which are cumbersome and have already manifested a number of limitations and shortcomings.

Keywords: Permutation, Aunu number, patterns.