Fujita’s conjecture on iterated accumulation points of pseudo-effective thresholds

We show that k-th iterated accumulation points of pseudo-effective thresholds of n-dimensional varieties are bounded by n-k+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n-k+1$$\end{document}.