ACC for foliated log canonical thresholds
Yen-An Chen
TL;DR
This paper extends the ascending chain condition (ACC) for log canonical thresholds to foliated settings in low dimensions. It defines foliated log canonical thresholds and develops a foliated minimal model program framework, including foliated dlt modifications and adjunction along invariant and non-invariant divisors, to control boundary coefficients. The authors prove a finiteness theorem: for dimensions $n\le 3$ and foliation rank $r<n$, the coefficients of boundary divisors in lc foliated triples with a common lc centre inside the boundary lie in a finite subset determined by the ambient coefficient set. Consequently, ACC for foliated LCT follows, covering rank-one foliations on surfaces and rank-one/rank-two foliations on threefolds, with detailed case analyses using adjunction, resolution of singularities, and MMP. The results align foliated birational geometry with established ACC results in the non-foliated setting for the crucial low-dimensional cases, enabling robust inductive approaches in the foliated MMP program.
Abstract
It is known that the set of log canonical thresholds (lcts) on any varieties with fixed dimension satisfies the ascending chain condition. Inspired by the foliated minimal model program, it is intriguing to study the foliated version of lcts and ask whether they have the similar property. We give an affirmative answer in the case of surfaces and threefolds.
