Restricted 132-avoiding permutations (Q5933473): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/aama.2000.0719 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/AAMA.2000.0719 / rank | |||
Normal rank | |||
Latest revision as of 11:58, 9 December 2024
scientific article; zbMATH DE number 1599092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted 132-avoiding permutations |
scientific article; zbMATH DE number 1599092 |
Statements
Restricted 132-avoiding permutations (English)
0 references
8 April 2002
0 references
For any positive integer \(n\), let \(S_n\) be the set of all permutations on \(n\) letters. Further let \(S_n(\alpha)\) denote the set of all \(\alpha\)-avoiding permutations in \(S_n\). In this paper the authors consider the generating function for \(|S_n(132)|\).
0 references
permutations
0 references
generating function
0 references
