Kerov's conjecture on Macdonald-positive specializations
Statement
Assume . A specialization of the algebra of symmetric functions is Macdonald-positive if for every partition . Let and be sequences of non-negative reals satisfying
and let . Kerov's conjecture. Every Macdonald-positive specialization is parameterized by a unique triple of this form, with power-sum values
and equivalently
where . The completeness of this parameterization is a difficult open problem known as Kerov's conjecture.
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.