k-multi-layered maximizer conjecture at a root-of-unity specialization
k-multi-layered maximizer conjecture at a root-of-unity specialization
Fix , let be a -th root of unity, and let denote the principal specialization at . Define
and let be the corresponding maximum over -multi-layered permutations. k-multi-layered maximizer conjecture. Given , for every , all permutations reaching the maximum under principal specialization at are -multi-layered permutations. In other words,
Thus, there is a limit
The paper proves matching asymptotics for the restricted maximum and gives general upper and lower bounds for ; the unrestricted maximization statement and its limiting formula remain open.
Sources & referencesView supporting material
Primary source
Ningxin Zhang, “Principal specializations of Schubert polynomials, multi-layered permutations and asymptotics”, arXiv:2311.04487 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.