Write for the number of permutations of satisfying for every , including . We prove that for every , with exactly the polynomials listed in A189281. Row of the accompanying coefficient table gives in ascending degree, starting at row zero. We also verify the published order-thirteen operator. Conjecture 10 · OEIS operators · Coefficient table
1. Inclusion–exclusion on two chains
Put and . The odd and even positions, in their natural orders, form two chains of lengths . The values form two chains with the same lengths. An offending pair is an oriented adjacency of a value chain that maps to an oriented adjacency of a position chain under .
Use inclusion–exclusion on these value-chain adjacencies. A selected subset groups each value chain into an ordered list of blocks of consecutive values of the same parity. A block of length has sign . Assign each block to one of the position chains. Within that chain its entries must be consecutive, in the specified order. If blocks go to position chain , there are orders for them, provided they fill that chain. Blocks are distinguishable by their original value intervals. This counts every permutation satisfying the selected adjacencies exactly once.
Let mark the length of position chain , and the length of value chain . Let be independent unit exponential random variables, so . Summing a nonempty signed block gives . Summing the ordered list of such blocks in each value chain gives the generating function
Then is the coefficient of in . All series and expectations here are coefficientwise, so each uses only finitely many moments.
2. A Schur moment
Realize for independent complex Gaussian coordinates with density . Write and . The matrix determinant lemma gives
For a two-part partition with , write for its Schur character. The two-variable Cauchy identity gives
Indeed, for eigenvalues of , the Cauchy kernel is . This identity also follows directly by summing the two-variable alternant formula for . It extends to all matrices by polynomial identity in each homogeneous degree.
The random matrix is invariant in law under unitary conjugation. For on , the expectation commutes with every , . This representation is irreducible. On homogeneous polynomials, the diagonal torus separates the monomials and the two off-diagonal infinitesimal operators connect adjacent monomials, proving irreducibility of the symmetric power. The determinant twist preserves it. Schur’s lemma and the trace therefore give
Let . It has density on the positive half-line. The eigenvalues of are . Put , so the dimension in (2) is . The alternant formula has denominator , which cancels the factor in the density. Define . Integration by parts gives and , the derangement numbers. The scalar in (2) is exactly
3. Extracting the count
For each subset of the four cells of a -by- square, write and let be its row and column sums. Selecting these numerator factors in (1) leaves total degree on each side. Put
The weights of are the monomials of total degree with each exponent at least , each with coefficient one. The same applies to . Thus
A negative upper limit gives zero. For every nonempty inner sum , so its denominators are nonzero. This proves the formula including .
4. A two-step recurrence for the full sum
For define
The second expression for pairs with . In separate the endpoints . Together they contribute by the derangement recurrence. At each interior index , substitute . The constant terms sum to zero by . Writing in the remaining terms yields
Also . The half-index terms satisfy .
5. Exact substitution into the conjectured operators
Here are the finite polynomial identities completing the proof. The included checker expands them over , using the coefficients in A189281. We describe the arithmetic explicitly so that the identity can be replayed in another algebra system. Checker · Original operator · Published factorization of the order-thirteen operator
For write , where is arbitrary. Treat as six independent indeterminates over , with representing in the inhomogeneous recurrences. Generate the required positive shifts by (5) and the three first-order recurrences above. For each numerator subset take and let be the cutoff in (4) calculated at . The contribution to is
Indeed the full sum includes exactly those omitted pairs with . Formula (3) gives the displayed summand. All denominator factors are nonzero rational constants. Each computed is thus a linear form in the six indeterminates with polynomial coefficients in .
Applying the original order-eight operator gives the following six coefficients in the indicated order.
| Base index | ||||||
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | |
| 0 | 0 | 0 | 0 | 0 | 0 |
The checker verifies the same two polynomial identities for the equivalent order-thirteen operator using van Hoeij’s factorization. For direct substitution of (4) gives residual zero for both operators. Every occurs in these four initial indices or one of the two polynomial identities, proving the conjecture.