ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be a positive integer and xx a real number. Define the d×2dd\times 2d matrix Ad,x=(ai,j)A_{d,x}=(a_{i,j}) by

ai,j={x,1⩽j⩽d+1−i,1,d+2−i⩽j⩽d+i,0,d+i+1⩽j⩽2d.a_{i,j}=\begin{cases} x,&1\leqslant j\leqslant d+1-i,\\ 1,&d+2-i\leqslant j\leqslant d+i,\\ 0,&d+i+1\leqslant j\leqslant 2d. \end{cases}

Let

Rd={(ρ1,ρ2,…,ρd)∣1⩽ρi⩽d+i,01⩽i⩽d, and ρr≠ρs for r≠s},R_d=\{(\rho_1,\rho_2,\ldots,\rho_d)\mid 1\leqslant\rho_i\leqslant d+i,01\leqslant i\leqslant d,\ \text{and}\ \rho_r\neq\rho_s\text{ for }r\neq s\},

and define

Ωd(x)=∑ρ∈Rda1,ρ1a2,ρ2⋯ad,ρd.\Omega_d(x)=\sum_{\rho\in R_d}a_{1,\rho_1}a_{2,\rho_2}\cdots a_{d,\rho_d}.

Kløve's generalized conjecture. For every positive integer dd,

Ωd(x)=∑m=0d(dm)(m+1)d(x−1)d−m.\Omega_d(x)=\sum_{m=0}^d{d\choose m}(m+1)^d(x-1)^{d-m}.

Kløve introduced this function to obtain bounds for the sizes of spheres in permutation codes under the Chebychev distance. The original conjecture is the specialization x=2x=2; the paper proves this generalized identity, settling the conjecture positively.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.