Generating stable permutations (Q1087542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating stable permutations |
scientific article; zbMATH DE number 3987279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating stable permutations |
scientific article; zbMATH DE number 3987279 |
Statements
Generating stable permutations (English)
0 references
1986
0 references
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.\))
0 references
stable permutations
0 references
