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… 
2017
2017
A zero-one matrix $A$ contains another zero-one matrix $P$ if some submatrix of $A$ can be transformed to $P$ by changing some… 
2017
2017
Lattice path enumeration and its applications have been studied by researchers in many areas such as computer science… 
2016
2016
In 1999 in [J. Difference Equ. Appl. 5, 355–377], Noonan and Zeilberger extended the Goulden-Jackson Cluster Method to find… 
2014
2014
In this paper we study pattern avoidance in Latin Squares, which gives us a two dimensional analogue of the well studied notion… 
2014
2014
The novel on-chip network in silicon proven design to support guaranteed traffic permutation in multiprocessor SOC applications… 
2013
2013
The number of $k$-roots of an arbitrary permutation is expressed as an alternating sum of $\mu$-unimodal $k$-roots of the… 
2012
2012
Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the… 
2011
2011
The orthomorphic permutation is a kind of one-to-one mapping from to F2. Orthomorphic permutations can be used in the… 
1997
1997
Deadlock recovery as a viable alternative to deadlock avoidance has recently gained an increasing consideration in the scientific…