On finiteness of log canonical models

Let [Formula: see text] be klt pairs with [Formula: see text] a convex set of divisors. Assuming that the relative Kodaira dimensions of such pairs are non-negative, then there are only finitely many log canonical models when the boundary divisors vary in a rational polytope in [Formula: see text]. As a consequence, we show the existence of the log canonical model for a klt pair [Formula: see text] with real coefficients.

Non-Archimedean Tame Topology and Stably Dominated Types (AM-192)

Over the field of real numbers, analytic geometry has long been in deep interaction with algebraic geometry, bringing the latter subject many of its topological insights. In recent decades, model theory has joined this work through the theory of o-minimality, providing finiteness and uniformity statements and new structural tools. For non-archimedean fields, such as the p-adics, the Berkovich analytification provides a connected topology with many thoroughgoing analogies to the real topology on the set of complex points, and it has become an important tool in algebraic dynamics and many other areas of geometry. This book lays down model-theoretic foundations for non-archimedean geometry. The methods combine o-minimality and stability theory. Definable types play a central role, serving first to define the notion of a point and then properties such as definable compactness. Beyond the foundations, the main theorem constructs a deformation retraction from the full non-archimedean space of an algebraic variety to a rational polytope. This generalizes previous results of V. Berkovich, who used resolution of singularities methods. No previous knowledge of non-archimedean geometry is assumed and model-theoretic prerequisites are reviewed in the first sections.

Ehrhart Series of Polytopes Related to Symmetric Doubly-Stochastic Matrices

In Ehrhart theory, the $h^*$-vector of a rational polytope often provides insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic matrices, has a unimodal $h^*$-vector, but when even small modifications are made to the polytope, the same property can be very difficult to prove. In this paper, we examine the $h^*$-vectors of a class of polytopes containing real doubly-stochastic symmetric matrices.

A Finite Calculus Approach to Ehrhart Polynomials

A rational polytope is the convex hull of a finite set of points in ${\Bbb R}^d$ with rational coordinates. Given a rational polytope ${\cal P} \subseteq {\Bbb R}^d$, Ehrhart proved that, for $t\in{\Bbb Z}_{\ge 0}$, the function $\#(t{\cal P} \cap {\Bbb Z}^d)$ agrees with a quasi-polynomial $L_{\cal P}(t)$, called the Ehrhart quasi-polynomial. The Ehrhart quasi-polynomial can be regarded as a discrete version of the volume of a polytope. We use that analogy to derive a new proof of Ehrhart's theorem. This proof also allows us to quickly prove two other facts about Ehrhart quasi-polynomials: McMullen's theorem about the periodicity of the individual coefficients of the quasi-polynomial and the Ehrhart–Macdonald theorem on reciprocity.

Computing the Period of an Ehrhart Quasi-Polynomial

If $P\subset {\Bbb R}^d$ is a rational polytope, then $i_P(t):=\#(tP\cap {\Bbb Z}^d)$ is a quasi-polynomial in $t$, called the Ehrhart quasi-polynomial of $P$. A period of $i_P(t)$ is ${\cal D}(P)$, the smallest ${\cal D}\in {\Bbb Z}_+$ such that ${\cal D}\cdot P$ has integral vertices. Often, ${\cal D}(P)$ is the minimum period of $i_P(t)$, but, in several interesting examples, the minimum period is smaller. We prove that, for fixed $d$, there is a polynomial time algorithm which, given a rational polytope $P\subset{\Bbb R}^d$ and an integer $n$, decides whether $n$ is a period of $i_P(t)$. In particular, there is a polynomial time algorithm to decide whether $i_P(t)$ is a polynomial. We conjecture that, for fixed $d$, there is a polynomial time algorithm to compute the minimum period of $i_P(t)$. The tools we use are rational generating functions.