Polynomial-growth conjecture for minimal intermediate subfactors
Statement
Let be an irreducible subfactor with finite index, and let the number of minimal intermediate subfactors be counted over the inclusion . Polynomial-growth conjecture. There are constants such that, for every such inclusion, the number of minimal intermediate subfactors is less than
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.