Grigoriev–Koshevoy's exponential lower-bound conjecture for skew-Schur polynomials
Statement
Let be the skew-Schur polynomial, where is a skew shape, and let denote its tropicalization. The tropical semiring complexity of a tropical polynomial is the smallest number of gates in an arithmetic circuit over that computes it using the tropical semiring axioms.
Grigoriev–Koshevoy's conjecture. The tropical semiring complexity of is at least exponential.
This concerns the circuit complexity of tropicalizations of skew-Schur polynomials. The supplied source attributes the statement to Section 5 of Grigoriev and Koshevoy, but gives no resolution evidence; its status is therefore open.
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.