Boundedness conjecture for slc stable minimal models
Statement
Let , let be a DCC set, and let be a polynomial. The family consists of the slc stable minimal models with the indicated dimension, coefficient set, and numerical data.
Boundedness conjecture for slc stable minimal models. The family
is bounded.
The question is posed after discussing generalisations of the moduli theorem, including arbitrary base schemes, real coefficients, marked divisors, and relative stable minimal models. The source also notes that the family can be empty for some choices of data; the conjecture concerns boundedness when the family is defined.
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.