ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ,μ,ν,λ′,μ′,ν′\lambda,\mu,\nu,\lambda',\mu',\nu' be partitions, and define

Pλ′,μ′,ν′λ,μ,ν(n)=c(nλ+λ′;nμ+μ′,nν+ν′).P^{\lambda,\mu,\nu}_{\lambda',\mu',\nu'}(n)=c(n\lambda+\lambda';n\mu+\mu',n\nu+\nu').

Assume that f(n)=c(nλ;nμ,nν)f(n)=c(n\lambda;n\mu,n\nu) is a polynomial of degree dd, and that c(λ′;μ′,ν′)≠0c(\lambda';\mu',\nu')\neq 0. Generalised stretched Littlewood–Richardson polynomiality conjecture. There exists a polynomial g(n)g(n) of degree dd and an integer mm such that

Pλ′,μ′,ν′λ,μ,ν(n)=g(n)for n≥m.P^{\lambda,\mu,\nu}_{\lambda',\mu',\nu'}(n)=g(n)\quad\text{for }n\geq m.

In particular, if c(λ;μ,ν)=1c(\lambda;\mu,\nu)=1, then there exists an integer mm such that

P(n)=P(m)for n≥m.P(n)=P(m)\quad\text{for }n\geq m.

The conjecture generalises eventual polynomiality from stretched to translated, or generalised stretched, Littlewood–Richardson coefficients. The surrounding discussion motivates it using the piecewise-polynomial structure of Littlewood–Richardson coefficients, but the source supplies no proof or resolution status.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.