The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1998.2908 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171905396 / rank | |||
Normal rank | |||
Revision as of 20:26, 19 March 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
