Kløve's generalized formula for permutation-code sphere polynomials
Statement
Let be a positive integer and a real number. Define the matrix by
Let
and define
Kløve's generalized conjecture. For every positive integer ,
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 ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.