Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Algebraic Geometry

arXiv:1812.04262 (math)
[Submitted on 11 Dec 2018 (v1), last revised 7 Aug 2019 (this version, v3)]

Title:Fujita's conjecture on iterated accumulation points of pseudo-effective thresholds

Authors:Zhan Li
View PDF
Abstract:We show that $k$-th iterated accumulation points of pseudo-effective thresholds of $n$-dimensional varieties are bounded by $n-k+1$.
Comments: minor changes on the quote of Nakayama's subadditivity theorem
Subjects: Algebraic Geometry (math.AG)
Cite as: arXiv:1812.04262 [math.AG]
  (or arXiv:1812.04262v3 [math.AG] for this version)
  https://doi.org/10.48550/arXiv.1812.04262

Submission history

From: Zhan Li [view email]
[v1] Tue, 11 Dec 2018 08:20:12 UTC (12 KB)
[v2] Sun, 3 Feb 2019 13:22:58 UTC (12 KB)
[v3] Wed, 7 Aug 2019 02:50:47 UTC (12 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.AG
< prev   |   next >
new | recent | 2018-12
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)