The author develops two algorithms to determine all permutations \(\sigma =\left( \begin{matrix} 1\\ x_ 1\end{matrix} \begin{matrix} 2\\ x_ 2\end{matrix} ...\begin{matrix} n\\ x_ n\end{matrix} \right)\) of the same pattern, which is either the sequence \(\alpha_ 1,...,\alpha_{n-1}\in\{+,-\},\) where \(\alpha_ i=+\Leftrightarrow x_ i<x_{i+1},\) or the triple (A,M,cM) of subsets of \(\{\) 1,...,\(n\}\), whose \(x_ i\in A\Leftrightarrow x_ j=x_ i+1\) has \(j>1\), \(x_ i\in M\Leftrightarrow x_ i<x_{i+1}, x_ i\in cM\Leftrightarrow x_{i-1}<x_ i.\)
Recommendations
Cites work
- Enumeration of permutations with prescribed up-down and inversion sequences
- scientific article; zbMATH DE number 3263280 (Why is no real title available?)
- Permutations ayant une forme donnée
- Permutations with prescribed pattern
- Équidistribution des permutations ayant une forme donnée selon les avances et coavances
Cited in
(16)- Permutation representation of k-ary trees
- On zigzag permutations and comparisons of adjacent elements
- Generating stable permutations
- Permutation trees and variation statistics
- Some results of black’s permutations
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
- Taking decision with the help of black’s permutation for imprecise – ordinal data
- scientific article; zbMATH DE number 4135943 (Why is no real title available?)
- On Strict Contractions
- Algorithms On Involutions
- Derivatives of Permutations
- Algorithms and Properties on Balanced Permutations
- On the construction of Eulerian permutations
- Generating planar permutations
- Perfect trees and bit-reversal permutations
- Fibonacci permutations as symmetric subsets of a groupoid
This page was built for publication: Some considerations on permutation trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799671)
