Non-Associative Property of 123-Avoiding Class of Aunu Permutation Patterns

This paper presents the non-associative and non-commutative properties of the 123-avoiding patterns of Aunu permutation patterns. The generating function of the said patterns has been reported earlier by the author [1] [2]. The paper describes how these non-associative and non commutative properties can be established by using the Cayley table on which a binary operation is defined to act on the 123-avoiding and 132-avoiding patterns of Aunu permutations using a pairing scheme. Our results have generated larger matrices from permutations of points of the Aunu patterns of prime cardinality. It follows that the generated symbols can be used in further studies and analysis in cryptography and game theory thereby providing an interdisciplinary approach and applications of these important permutation patterns.


Introduction
Non-associative algebraic structures arise in many situations.Cayley octonions are a notorious example, but there are far more; for example, nonassociative loop arise in cordinatization of projective planes and the Einstein velocity addition in relativity theory also forms a nonassociative loop.Self distributive algebras appear naturally in the study of Braids [3].
The 123-avoiding class of the Aunu permutation patterns which have been found to be of both combinatorics and group theoretic importance [1] can also be used to construct some structures which are non-associative as well as non-commutative using Cayley table with a binary operation defined to act on such patterns.
Non-associative structures include structures like groupoids, quasigroup and loops, nonassociative semi-rings as well as self distributive algebras and mediality.The oldest and most developed discipline of nonassociative algebra originated in 1930s in works of Sushkevich, Moufang, Bol, Mordorch, and others, see [4] for comprehensive historical notes.One of the earliest surveys on nonassociative algebras is the article by [5] which introduced the phrase "rings that are linearly associative".The first book in the English Language devoted to a systematic study of nonassociative algebras is [6].A collection of open research problems in algebra is the Dniester Notebook [7]; The survey article by [8] is from the same period.Three books on Jordan algebras which contain substantial material on general non associative algebras are [9]- [11].
Recent researches appear in the Proceedings of International Conferences on Nonassociative Algebra and its Applications [12]- [14].The topic is covered by several books [15]- [19] that study various aspects of the theory, and reflect different eras of non-associative mathematics.
In order to make this paper more self-contained, some notation overview is here under presented of some key concepts used in the paper.

Permutation Patterns
An arrangement of the objects 1, 2, , n  is a sequence consisting of these objects arranged in any order.When in addition, a particular order of arrangement is desired, such an arrangement becomes an ordered arrangement governed by a pattern σ and each such permutation n S σ ∈ naturally results into a certain arrangement of 1, 2, , n  given by ( ) ( ) ( ) which is called the arrangement associated with a permutation pattern σ of points of a nonempty set Given a sequence π consisting of n elements arranged in a given pattern and another sequence σ hav- ing m elements such that m n < , then σ is said to be contained as a pattern in π provided π has a sub- sequence which is order isomorphic to σ .If π does not contain σ it is said to avoid it.The set of all the σ -avoiding permutations is denoted It is useful to differentiate between a subsequence and a subword.For instance, if n S σ has remained a hard and intractable problem for a given σ containing more than three elements.This is among the reasons that motivate the author to construct some classes of pattern-avoiding permutations using some special subword (instead of subsequences) governed by some succession schemes [2].Thus, ( ) in this context, represents the sub words of length 3 n ≥ that are (132)-avoiding in n A being the set of strictly consecutive succession scheme containing pairs , i j such that 1, ,

Aunu Permutation Patterns
It was reported by [2] [20] [21] in a generalized and elaborate enumeration scheme of a recursion relation for generation of some special classes of ( 123) and ( 132)-avoiding permutation patterns of Aunu patterns.[22] identified a new and more generalized generating function for the Aunu pattern which was based on the method employ by [23].He also further identified and discussed some other theoretic properties of the Aunu patterns and Aunu Groups especially in relation to integer modulo groups.The theoretical application of both Aunu pattern and Aunu Group from the method of generating function was identified by [22].

Method of Construction
The basic procedure for generating the special permutation patterns under study, have already been outlined, see for instance [2] [24] as well as [1].However, for the sake clarity, the basic procedure is once more, highlighted below.

The Special (123)-Avoiding Scheme
As a pairing scheme involving pairs of numbers associated by some precedence relation [1] [24].The governing conditions for the generation of these numbers are outlined below.The elements are paired in order of precedence , , , where n C is a cycle of length n while , i j λ λ are in the th i and th j positions in the permutation pattern generated by the precedence parameter Θ .
The precedence parameter acts on the elements to produce pairs such as are related as; element and first successor, element and second successor, up to element and th n successor.Under the given condition, is required that the th j partner shifts in position incrementally corresponding to the th n succession so that 1, 2, , where m n ≤ The enumeration scheme involves doubt regarding the identity of the first element in the desired pair.Moreover, absolute certainty is desired that by the end of the enumeration, the required pair, whichever it is, is achieved.
We now state an important theorem for the enumeration of these permutation patterns.

Proof
To prove this let us suppose a permutation ( )  .We now generate a special mapping ϒ on a such that elements of the permutation are mapped one on to another governed by a specified order of arrangement as in as in [2] thus:  ( )

Results
We now define a mapping where i enumerates the cycles formed in permutations of elements of Ω and j represents the shift in permuta- tion of elements of the symbols (elements) of Ω in a pairing scheme defined by (4) An illustrative Example is provided thus: for n = 5, a permutation can be generated for { } 1, 2,3, 4,5 Ω = using i as first symbol of Ω in a pairing scheme defined in (6).The first set of permuted elements of Ω can now be generated by the arrangement of elements of Ω as pairs of symbols both of increasing magnitude modulo 5; that is, for the first cycle C1 with I = 1 we have: ( ) n j Θ = + = completing the first cycle.without loss of generality, subsequent cycles can be constructed using similar procedure by rearrangement of elements of Ω .
It follows that Θ provides a shift among points of Ω corresponding to the length of the non empty set Ω in a pairing scheme.
The following Tables 1-5 provide summarized results for the aforementioned procedure on i.e.

It can be seen from
x y z from 132-avoiding patterns and the 123-avoiding class of Aunu permutations patterns with a binary operation Θ defined, ( ) ( ) x y z Θ Θ ≠ Θ Θ .Likewise x y y x Θ ≠ Θ .This has clearly shown to us that, the above constructed structures using Cayley table are non-as- sociative and non-commutative.

Conclusion
It follows that the permuted structures of Aunu scheme give rise to non-associative structures where points in Aunu permutations as elements of the derived sets in relation to pairing scheme modulo n, where n is necessarily a prime 5 ≥ .The precedence/pairing parameter Θ generates some sequences which can be studied further in relation to group action and transformation schemes.Further algebraic properties can also be investigated on these structures by using graph theoretic methods.Further, the matrices obtained from the resulting Cayley table appear to possess some combinatorial and number theoretic properties which can be investigated in subsequent researches.
σ as a subword although it does contain it as a subsequence.Occurrences of subwords can be over- lapped.As an example the sequence


We now rewrite these numbers in the form of sequence as follows:123 n  , 132-avoiding patterns and 123-avoiding patterns of Aunu numbers of cardinality n where n is necessarily a prime.
It can be seen from the above Cayley table that, it is closed under Θ but non-associative and commutative lawsdo not also hold.

Table 2
that the structure is non-associative and non commutative.

Table 1 .
Cayley table for n = 5 showing generated points of Ω as permutations of (132) and (123)-avoiding patterns of Aunu scheme under the action of Θ .

Table 2 .
Cayley table for n = 7 showing generated points of Ω as permutations of (132) and (123)-avoiding patterns of Aunu scheme under the action of Θ .

Table 3 .
Cayley table for n = 11 showing generated points of Ω as permutations of (132) and (123)-avoiding patterns of Aunu scheme under the action of Θ .

Table 4 .
Cayley table for n = 13 showing generated points of Ω as permutations of (132) and (123)-avoiding patterns of Aunu scheme under the action of Θ .

Table 5 .
Cayley table for n = 17 showing generated points of Ω as permutations of (132) (123)-avoiding patterns of Aunu scheme under the action of Θ .

Table 3
It can also be shown from Table 4 that associativity and commutivity with respect to binary operation Θ do