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...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.展开更多
The problem of relevant enumeration with pattern-avoiding permutations is a significant topic in enumerative combinatorics and has wide applications in physics,chemistry,and computer science.This paper summarizes the ...The problem of relevant enumeration with pattern-avoiding permutations is a significant topic in enumerative combinatorics and has wide applications in physics,chemistry,and computer science.This paper summarizes the relevant conclusions of the enumeration of pattern-avoiding permutations on the nelement symmetric group Sn,alternating permutations,Dumont permutations,Ballot permutations,and inversion sequences.It also introduces relevant research results on avoiding vincular patterns and barred patterns in S_(n).展开更多
Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened ...Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.展开更多
文摘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.
文摘The problem of relevant enumeration with pattern-avoiding permutations is a significant topic in enumerative combinatorics and has wide applications in physics,chemistry,and computer science.This paper summarizes the relevant conclusions of the enumeration of pattern-avoiding permutations on the nelement symmetric group Sn,alternating permutations,Dumont permutations,Ballot permutations,and inversion sequences.It also introduces relevant research results on avoiding vincular patterns and barred patterns in S_(n).
文摘Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.
