English
Related papers

Related papers: The minimal model program for b-log canonical divi…

200 papers

Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First, we show that, for each natural number d, an oracle for the set of algebraic real numbers of degree at most d is…

Logic in Computer Science · Computer Science 2015-07-01 Wesley Calvert , Ken Kramer , Russell Miller

Using techniques from the theory of foliations, we establish the cone theorem and the contraction theorem for lc generalized pairs in full generality, and meanwhile develop the minimal model program for $\mathbb Q$-factorial foliated dlt…

Algebraic Geometry · Mathematics 2026-05-29 Guodu Chen , Jingjun Han , Jihao Liu , Lingyao Xie

In this paper, we study the $G$-equivariant noncommutative minimal model program ($G$-NMMP), as an equivariant generalization of the framework introduced in arXiv:2301.13168. The aim of this program is to construct quasi-convergent paths in…

Algebraic Geometry · Mathematics 2026-02-25 Dongjian Wu , Nantao Zhang

We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…

Algebraic Geometry · Mathematics 2020-10-21 Benjamin Antieau , Lennart Meier

This paper is concerned with a minimal resolution of the PROP for bialgebras. We prove a theorem about the form of this resolution (Theorem 15) and give, in Section 5, a lot of explicit formulas for the differential. Our minimal model…

Algebraic Topology · Mathematics 2007-05-23 Martin Markl

In the case of toric varieties, we continue the pursuit of Kontsevich's fundamental insight, Homological Mirror Symmetry, by unifying it with the Mori program. We give a refined conjectural version of Homological Mirror Symmetry relating…

Algebraic Geometry · Mathematics 2013-02-05 Matthew Ballard , Colin Diemer , David Favero , Ludmil Katzarkov , Gabriel Kerr

We present Integer Linear Programming (ILP) Modulo Theories (IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background theories. In previous work, the IMT approach has been…

Logic in Computer Science · Computer Science 2013-04-09 Panagiotis Manolios , Vasilis Papavasileiou

We prove that the class of log canonical rational singularities is closed under the basic operations of the minimal model program. We also give some supplementary results on the minimal model program for log canonical surfaces.

Algebraic Geometry · Mathematics 2015-03-05 Osamu Fujino

The purpose of this paper is to give two applications of Fourier transforms and generic vanishing theorems: - we give a cohomological characterization of principal polarizations - we prove that if $X$ an abelian variety and $\Theta $ a…

Algebraic Geometry · Mathematics 2007-05-23 Christopher D. Hacon

We study multiplicative properties of the (quantum) dual canonical basis B* associated to a semi-simple complex Lie group G. We provide a subset D of B* such that the following property holds : if two elements b, b' in B* q-commute and if…

Representation Theory · Mathematics 2007-05-23 Philippe Caldero

In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…

Commutative Algebra · Mathematics 2025-10-20 Vladimir P. Gerdt , Yuri A. Blinkov

Let $(X,\Delta)$ be a projective, log canonical, $K$-trivial pair over the complex numbers. Let $Z$ be a minimal log canonical center of $(X,\Delta)$ and suppose that there exists a torus $\mathbb{T}\subseteq\operatorname{Aut}(X)$…

Algebraic Geometry · Mathematics 2026-02-25 Linus Rösler

Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…

Computational Complexity · Computer Science 2020-05-13 Shaull Almagor , Dmitry Chistikov , Joël Ouaknine , James Worrell

Originally a technical tool, the derived category of coherent sheaves over an algebraic variety has become over the last twenty years an important invariant in the birational study of algebraic varieties. Problems of birational invariance…

Algebraic Geometry · Mathematics 2007-05-23 Raphael Rouquier

In this paper we show that any Bohr-zero non-periodic set $B$ of traceless integer valued matrices, denoted by $\Lambda$, intersects non-trivially the conjugacy class of any matrix from $\Lambda$. As a corollary, we obtain that the family…

Dynamical Systems · Mathematics 2017-03-27 Alexander Fish

The goal of this paper is a classification theorem of the singularities according to a new invariant, Mather discrepancy. On the other hand, we show some evidences convincing us that Mather discrepancy is a considerable invariant: By…

Algebraic Geometry · Mathematics 2012-04-23 Shihoko Ishii

For algebraic stacks over number fields, we define their Brauer-Manin sets, Brauer-Manin pairings, and extend the descent theory of Colliot-Th\'el\`ene and Sansuc. By extending Sansuc's exact sequence, we show the torsionness of Brauer…

Algebraic Geometry · Mathematics 2026-05-01 Chang Lv , Han Wu

The nonvanishing conjecture for projective log canonical pairs plays a key role in the minimal model program of higher dimensional algebraic geometry. The numerical nonvanishing conjecture considered in this paper is a weaker version of the…

Algebraic Geometry · Mathematics 2020-02-05 Jingjun Han , Wenfei Liu

For every $d \geq 4$, we construct a $d$-dimensional, log canonical, $K$-trivial variety with the property that two general fibers of its Albanese morphism are not birational. This provides a strong counterexample to the…

Algebraic Geometry · Mathematics 2026-05-11 Fabio Bernasconi , Stefano Filipazzi , Zsolt Patakfalvi , Nikolaos Tsakanikas

A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer…

Computational Complexity · Computer Science 2014-10-14 Joël Ouaknine , João Sousa Pinto , James Worrell