Skip to search formSkip to main contentSkip to account menu

Permutation pattern

Known as: Patern-avoiding permutation, Pattern-avoiding permutations, Pattern-avoiding permutation 
In combinatorial mathematics and theoretical computer science, a permutation pattern is a sub-permutation of a longer permutation. The permutation… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Let B be an n by n doubly substochastic matrix. We show that B can be written as a convex combination of no more than {\sigma}(B… 
2016
2016
In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents… 
2013
2013
The number of $k$-roots of an arbitrary permutation is expressed as an alternating sum of $\mu$-unimodal $k$-roots of the… 
2010
2010
In this paper we investigate the existence of permutation polynomials of the form F(x) = xd + L(x) over GF(2n), L being a linear… 
2006
2006
The list of species whose complete DNA sequence have been read, is growing steadily and it is believed that comparative genomics… 
2004
2004
A permutation $\pi$ of an abelian group $G$ (that is, a bijection from $G$ to itself) will be said to avoid arithmetic… 
1999
1999
On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and XOR Operators Steven A. Myers… 
1998
1998
This chapter analyzes the communication capabilities of Partitioned Optical Passive Stars (POPS) networks. POPS is a topological… 
1997
1997
Deadlock recovery as a viable alternative to deadlock avoidance has recently gained an increasing consideration in the scientific…