Enumerating split-pair arrangements (Q2474497): 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.1016/j.jcta.2007.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2154534416 / rank | |||
Normal rank | |||
Revision as of 18:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating split-pair arrangements |
scientific article |
Statements
Enumerating split-pair arrangements (English)
0 references
6 March 2008
0 references
An arrangement of the \(2n\) numbers \(1,1,2,2,\ldots,n,n\) is called split-pair if for each \(i<n\), exactly one \(i+1\) occurs between the two occurrences of \(i\). The authors prove that the number of such arrangements is equal to \[ (-1)^{n+1}2^n(2^{2n}-1)B_{2n} \] where \(B_i\) denotes the \(i\)th Bernoulli number.
0 references
enumeration
0 references
permutations
0 references
Bernoulli numbers
0 references
robotic scheduling
0 references
