Some considerations on permutation trees

DOI10.1016/0012-365X(83)90098-5zbMATH Open0548.05002MaRDI QIDQ799671FDOQ799671

Antonios Panayotopoulos

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article
• scientific article; zbMATH DE number 2081004
• Generating permutations with given ups and downs
• Permutations avoiding two patterns of length three
• Pattern matching for permutations

zbMATH Keywords

permutationspatternfactorial tree

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Permutations with prescribed pattern
• Enumeration of permutations with prescribed up-down and inversion sequences
• Permutations ayant une forme donnée
• Équidistribution des permutations ayant une forme donnée selon les avances et coavances

Cited In (15)

• Taking decision with the help of black’s permutation for imprecise – ordinal data
• Algorithms On Involutions
• On the construction of Eulerian permutations
• Generating stable permutations
• Permutation trees and variation statistics
• Title not available (Why is that?)
• Derivatives of Permutations
• On Strict Contractions
• Algorithms and Properties on Balanced Permutations
• Some results of black’s permutations
• Generating planar permutations
• Permutation representation of k-ary trees
• On zigzag permutations and comparisons of adjacent elements
• Perfect trees and bit-reversal permutations
• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations

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)