Related papers: Log canonical inversion of adjunction
We propose a variant of the effective adjunction conjecture for lc-trivial fibrations. This variant is suitable for inductions and can be used to treat real coefficients.
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.
We construct a generic extension in which the aleph_2 nd canonical function on aleph_1 exists.
We generalize the concept of disjunction.
A glottochronologic retrognostic of language system is proposed
By suitable examples we illustrate an algorithm for composition of inverse problems.
In this short note we present a family of counterexamples to the King's conjecture.
This is a short expository article on alternating knots and is to appear in the Concise Encyclopedia of Knot Theory.
We describe the set of minimal log discrepancies of toric log varities, and study its accumulation points.
A simple proof is given for the convexity of log det (I+K X^{-1}) in the positive definite matrix variable X with a given positive semidefinite K.
This is a brief overview of some turning points in the history of infinitesimals.
This is an exposition of the inverse spectral theory of canonical systems based on de Branges spaces of entire functions
We record an explicit proof of the theorem that lifts a two-variable adjunction to the arrow categories of its domains.
In terms of log canonical threshold, we characterize plurisubharmonic functions with logarithmic asymptotical behaviour.
New cases of the multiplicity conjecture are considered.
We prove the finiteness of log pluricanonical representations for projective log canonical pairs with semi-ample log canonical divisor. As a corollary, we obtain that the log canonical divisor of a projective semi log canonical pair is…
We prove the abundance theorem for numerically trivial log canonical divisors of log canonical pairs and semi-log canonical pairs.
This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…
We prove a version of adelic descent for continuous localizing invariants.