Received 24 November 2015; accepted 24 January 2016; published 28 January 2016
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  .
The 123-avoiding class of the Aunu permutation patterns which have been found to be of both combinatorics and group theoretic importance  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  for comprehensive historical notes. One of the earliest surveys on nonassociative algebras is the article by  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  . A collection of open research problems in algebra is the Dniester Notebook  ; The survey article by  is from the same period. Three books on Jordan algebras which contain substantial material on general non associative algebras are  - .
Recent researches appear in the Proceedings of International Conferences on Nonassociative Algebra and its Applications  - . The topic is covered by several books  - 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.
1.1. Permutation Patterns
An arrangement of the objects 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 naturally results into a certain arrangement of given by
which is called the arrangement associated with a permutation pattern of points of a nonempty set
Given a sequence consisting of elements arranged in a given pattern and another sequence having elements such that, then is said to be contained as a pattern in provided has a subsequence 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 then contains as a subword since. However, does not contain as a subword although it does contain it as a subsequence. Occurrences of subwords can be overlapped. As an example the sequence contains two occurrences of: 7162 and 6243
Determination of 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  . Thus, in this context, represents the sub words of length that are (132)-avoiding in being the set of strictly consecutive succession scheme containing pairs such that
1.2. Aunu Permutation Patterns
It was reported by    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.  identified a new and more generalized generating function for the Aunu pattern which was based on the method employ by  . 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  .
2. Method of Construction
The basic procedure for generating the special permutation patterns under study, have already been outlined, see for instance   as well as  . 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   . The governing conditions for the generation of these numbers are outlined below.
The elements are paired in order of precedence
where is a cycle of length while are in the and 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 successor.
Under the given condition, it is required that the partner shifts in position incrementally corresponding to the succession so that
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.
The number of subwords for the permutation patterns under study is enumerated as: 2,3,5,5,8, ∙∙∙ corresponding to the length (cardinality) of the special (123)-avoiding sequences 5,7,11,13,17, ∙∙∙  .
To prove this let us suppose a permutation. We now generate a special mapping on such that elements of the permutation are mapped one on to another governed by a specified order of arrangement as in as in  thus:
We now rewrite these numbers in the form of sequence as follows:
, up to
We now define a mapping of 132-avoiding patterns and 123-avoiding patterns of Aunu numbers of cardinality n where n is necessarily a prime.
where represents the (123)-avoiding patterns of Aunu permutation re-
ported in theorem 2.1; and n is prime greater than or equal to five.
where i enumerates the cycles formed in permutations of elements of and j represents the shift in permutation 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 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:
, , , ,
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 and for n = 5, 7, 11, 13 and 17.
We now use the entries of the Cayley table to test non-associativity of points in Aunu permutations patterns of.
It can be seen from the above Cayley table that, it is closed under but non-associative and commutative lawsdo not also hold.
It can be shown from 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) and (123)-avoiding patterns of Aunu scheme under the action of.
Also, , , etc.
It can be seen from Table 3 that:
It can also be shown from Table 4 that associativity and commutivity with respect to binary operation do not hold.
It can be seen that the above structure is non-associative and non-commutative.
Also, , 5, etc.
This can be stated in a general form as, taken any from 132-avoiding patterns and the 123-avoiding class of Aunu permutations patterns with a binary operation defined,. Likewise. This has clearly shown to us that, the above constructed structures using Cayley table are non-as- sociative and non-commutative.
It follows that the permuted structures of Aunu scheme give rise to non-associative structures where points in Aunu permutations are regarded as elements of the derived sets in relation to pairing scheme modulo n, where n is necessarily a prime. 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.