The asymptotics of almost alternating permutations (Q696815): 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/aama.2001.0790 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2156810229 / rank | |||
Normal rank |
Revision as of 20:45, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The asymptotics of almost alternating permutations |
scientific article |
Statements
The asymptotics of almost alternating permutations (English)
0 references
12 September 2002
0 references
The paper studies asymptotic enumeration of permutations, which are alternating except for a finite number of exceptions. Let \(\beta(l_1,l_2,l_3,\dots ,l_k)\) denote the number of permutations that consist of \(l_1\) ascents, \(l_2\) descents, \(l_3\) ascents, etc. The paper obtains the EGF for the sequence \(\beta(L, 1^{n-m-1})\), where \(L\) is a descent-ascent list of size \(m\). Using the EGF, an asymptotic formula is developed for \(\beta(L, 1^{n-m-1})\), and also for \(\beta(1^a,2,1^b)\) and \(\beta(L_1,1^a,L_2,1^b,L_3)\). All the asymptotics involve Euler numbers, which are in this notation \(\beta(1^{n-1})\).
0 references
boustrophedon transform
0 references
Euler number
0 references
Viennot triangle
0 references