Uniform K-stability, Duistermaat–Heckman measures and singularities of pairs
نویسندگان
چکیده
منابع مشابه
Singularities of Pairs
Higher dimensional algebraic geometry has been one of the most rapidly developing research areas in the past twenty years. The first decade of its development centered around the formulation of the minimal model program and finding techniques to carry this program through. The proof of the existence of flips, given in [Mori88], completed the program in dimension three. These results, especially...
متن کاملUniform measures and uniform rectifiability
In this paper it is shown that if μ is an n-dimensional Ahlfors-David regular measure in R which satisfies the so-called weak constant density condition, then μ is uniformly rectifiable. This had already been proved by David and Semmes in the cases n = 1, 2 and d − 1, and it was an open problem for other values of n. The proof of this result relies on the study of the n-uniform measures in R. I...
متن کاملRational Singularities Associated to Pairs
Rational singularities are a class of singularities which have been heavily studied since their introduction in the 1960s. Roughly speaking, an algebraic variety has rational singularities if its structure sheaf has the same cohomology as the structure sheaf of a resolution of singularities. Rational singularities enjoy many useful properties, in particular they are both normal and Cohen-Macaul...
متن کاملUniform measures and countably additive measures
Uniform measures are defined as the functionals on the space of bounded uniformly continuous functions that are continuous on bounded uniformly equicontinuous sets. If every cardinal has measure zero then every countably additive measure is a uniform measure. The functionals sequentially continuous on bounded uniformly equicontinuous sets are exactly uniform measures on the separable modificati...
متن کاملUniform Characterizations of Non-Uniform Complexity Measures
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2017
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.3096