ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N⊆MN\subseteq M be an irreducible subfactor with finite index, and let the number of minimal intermediate subfactors be counted over the inclusion N⊆MN\subseteq M. Polynomial-growth conjecture. There are constants c1,c2c_1,c_2 such that, for every such inclusion, the number of minimal intermediate subfactors is less than

c2[M:N]c1.c_2[M:N]^{c_1}.

The paper proves an exponential upper bound for the number of minimal intermediate subfactors and conjectures that polynomial growth should hold instead. The source gives no resolution of this 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 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.