Foundations of Computational Mathematics 2002
DOI: 10.1142/9789812778031_0001
|View full text |Cite
|
Sign up to set email alerts
|

Extending Triangulations and Semistable Reduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In fact, our main combinatorial result, Theorem 4.5.2, can be viewed as a local on the base version of that conjecture, and the two problems are tightly related. In particular, Dan Abramovich pointed out that the first stage of our construction, existence of a polysimplicial subdivision, was established in the global setting in [AR02]. The conjecture of Abramovich-Karu can be treated by our method as well, and is the subject of [ALT18].…”
Section: Resultsmentioning
confidence: 99%
“…In fact, our main combinatorial result, Theorem 4.5.2, can be viewed as a local on the base version of that conjecture, and the two problems are tightly related. In particular, Dan Abramovich pointed out that the first stage of our construction, existence of a polysimplicial subdivision, was established in the global setting in [AR02]. The conjecture of Abramovich-Karu can be treated by our method as well, and is the subject of [ALT18].…”
Section: Resultsmentioning
confidence: 99%