The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123366307, #quickstatements; #temporary_batch_1707303357582 |
Removed claim: reviewed by (P1447): Item:Q587392 |
||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
Revision as of 08:17, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The solution of a conjecture of Stanley and Wilf for all layered patterns |
scientific article |
Statements
The solution of a conjecture of Stanley and Wilf for all layered patterns (English)
0 references
31 August 1999
0 references
Wilf and Stanley conjectured that the number of permutations in \(S_n\) that avoid a particular pattern, or subpermutation, \(q\) is less than \(c^n\), where \(c\) is a constant depending on \(q\). The author proves the result for patterns \(q\) of a particular special type (``layered'' patterns).
0 references
number of permutations
0 references
pattern
0 references
