Letting (Nℓ )ℓ denote the number of lattice paths using only east and north steps (of arbitrary lengths) from (2, 1) to (d − 1, d) or (d, d − 1) that have ℓ steps, also the…
Statement
Letting (Nℓ )ℓ denote the number of lattice paths using only east and north steps (of arbitrary lengths) from (2, 1) to (d − 1, d) or (d, d − 1) that have ℓ steps, also the following conjecture is open. 10. Optimizing over nonzero LR coefficients (problem of Matjaž Konvalinka) (Problem communicated by Igor Klep at University of Ljubljana.) Given a parti- tion \lambda of length d, define d d(d − 1)(2d − 1) X η(\lambda) = n2 + − (\lambdai − (i − 1))2 . 6 i=1 For \lambda, µ, ν we define ∆(\lambda, µ, ν) = η(\lambda) − η(µ) − η(ν). We are given n, k, d, k \leq n/2. The problem is to maximize ∆(\lambda, µ, ν) over triples (\lambda, µ, ν) with |\lambda| = n, |µ| = k, |ν| = n − k, for which the Littlewood-Richardson coefficient c\lambdaµ,ν is nonzero.
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.