English
Related papers

Related papers: Addendum to "Termination of 4-fold canonical flips…

200 papers

We prove the termination of 4-fold canonical flips.

Algebraic Geometry · Mathematics 2007-05-23 Osamu Fujino

Let $(X,\Delta)$ be a log canonical $4$-fold over an algebraically closed field of characteristic zero. We prove that any sequence of $(K_X+\Delta)$-flips terminates.

Algebraic Geometry · Mathematics 2025-08-06 Joaquín Moraga

In this paper, we prove the termination of 4-fold semi-stable log flips under the assumption that there always exist 4-fold (semi-stable) log flips.

Algebraic Geometry · Mathematics 2007-05-23 Osamu Fujino

We prove the termination of flips for 4-dimensional pseudo-effective NQC log canonical generalized pairs. As main ingredients, we verify the termination of flips for 3-dimensional NQC log canonical generalized pairs, and show that the…

Algebraic Geometry · Mathematics 2024-04-16 Guodu Chen , Nikolaos Tsakanikas

We show that mixed-characteristic and equi-characteristic small deformations of 3-dimensional canonical (resp. terminal) singularities with perfect residue field of characteristic $p>5$ are canonical (resp. terminal). We discuss…

Algebraic Geometry · Mathematics 2024-03-08 Fabio Bernasconi , Iacopo Brivio , Stefano Filipazzi

In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…

Symbolic Computation · Computer Science 2009-12-30 Xiaorong Hou , Song Xu , Junwei Shao

This paper has been withdrawn by the author due to a crucial error in Lemma 3.5.

Algebraic Geometry · Mathematics 2007-05-23 Yujiro Kawamata

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

Computational Geometry · Computer Science 2023-06-02 Hugo Akitaya , Josh Brunner , Erik D. Demaine , Dylan Hendrickson , Victor Luo , Andy Tockman

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

Combinatorics · Mathematics 2019-03-22 Kohei Tanaka

In this thesis, I determine a bound on the defect of terminal Gorenstein quartic 3-folds. More generally, I study the defect of terminal Gorenstein Fano 3-folds of Picard rank 1 and genus at least 3. I state a geometric "motivation" of non…

Algebraic Geometry · Mathematics 2007-07-13 Anne-Sophie Kaloghiros

We show that 3-fold terminal flips and divisorial contractions may be factored into a sequence of flops, blow-downs to a smooth curve in a smooth 3-fold or divisorial contractions to points with minimal discrepancies.

Algebraic Geometry · Mathematics 2013-04-23 Jungkai Alfred Chen

We show that 3-fold terminal flips and divisorial contractions to a curve may be factored by a sequence of weighted blow-ups, flops, blow-downs to a locally complete intersection curve in a smooth 3-fold or divisorial contractions to a…

Algebraic Geometry · Mathematics 2009-10-23 Jungkai A. Chen , Christopher D. Hacon

The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…

Differential Geometry · Mathematics 2013-01-24 Katharina Neusser

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…

Logic in Computer Science · Computer Science 2025-02-11 Naoki Kobayashi

We continue the work of [4, 2, 3], in which we discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality; or that we improve upon.

Geometric Topology · Mathematics 2020-01-31 Laurence Boxer

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

Computational Geometry · Computer Science 2015-09-09 Prosenjit Bose , Dana Jansens , André van Renssen , Maria Saumell , Sander Verdonschot

We show that terminal 3-fold divisorial contraction to a point of index $>1$ with non-minimal discrepancy may be factored into a sequence of flips, flops and divisorial contractions to a point with minimal discrepancies.

Algebraic Geometry · Mathematics 2011-06-10 Jungkai Alfred Chen

We provide an overview of CPF, the certification problem format, and explain some design decisions. Whereas CPF was originally invented to combine three different formats for termination proofs into a single one, in the meanwhile proofs for…

Logic in Computer Science · Computer Science 2014-10-31 Christian Sternagel , René Thiemann

We find an explicit upper bound for the anticanonical volume of Fano 4-folds with canonical singularities.

Algebraic Geometry · Mathematics 2022-09-20 Caucher Birkar

This survey aims to provide a guide to the literature on topological 4-manifolds. Foundational theorems on 4-manifolds are stated, especially in the topological category. Precise references are given, with indications of the strategies…

Geometric Topology · Mathematics 2024-01-03 Stefan Friedl , Matthias Nagel , Patrick Orson , Mark Powell
‹ Prev 1 2 3 10 Next ›