Divisors computing the minimal log discrepancy on a smooth surface

Masayuki Kawakita

REVIEW

Divisors computing the minimal log discrepancy on a smooth surface

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1606.01611 v2 pith:CAWR4RTO submitted 2016-06-06 math.AG

Divisors computing the minimal log discrepancy on a smooth surface

Masayuki Kawakita This is my paper

classification math.AG

keywords computingdiscrepancydivisorminimalsmoothsurfaceblow-upcanonical

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We study a divisor computing the minimal log discrepancy on a smooth surface. Such a divisor is obtained by a weighted blow-up. There exists an example of a pair such that any divisor computing the minimal log discrepancy computes no log canonical thresholds.

Divisors computing the minimal log discrepancy on a smooth surface

discussion (0)