Finite-jet detection of log canonical thresholds with quantitative bounds
Statement
- (Mustat ¸ˇ a) We have the ACC conjecture for log canonical thresholds ( Conjecture 2.5 of [6], see also [3]). When we consider only smooth varieties, the conjecture is equivalent to the following question: Fix n. ∀c ∈ R, does there exist k = k(c) such that
{f ∈ C[[ x1, · · ·, x n]] |lct (f ) ≥ c} depends on k-th truncations of f?A weaker question is: Does there exist k = k(f ) such that lct (f + g) ≥ lct (f ) for all g with ord (g) ≥ k?
Record
- Source
- Added
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.