Generating stable permutations
type: Item
instance of: scholarly article
title: Generating stable permutations
zbMATH Open document ID: 0611.05001
DOI: 10.1016/0012-365X(86)90121-4
author: Antonios Panayotopoulos
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: This short note presents a method of finding all stable permutations of the set \(\{\) 1,2,...,n\(\}\) and also a representative list for \(n\leq 9\). (''Stable'' means \(\sigma(i) - \sigma(j) \neq \pm(i-j)\) for all \(i\neq j.\))
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 3987279
zbMATH Keywords: stable permutations
reviewed by: T. Spircu
MaRDI profile type: Publication
cites work: Q5615282
cites work: Permutations with prescribed pattern
cites work: Some considerations on permutation trees
description: scientific article; zbMATH DE number 3987279