165 research outputs found
On a generalized canonical bundle formula for generically finite morphisms
We prove a canonical bundle formula for generically finite morphisms in the
setting of generalized pairs (with -coefficients). This complements
Filipazzi's canonical bundle formula for morphisms with connected fibres. It is
then applied to obtain a subadjunction formula for log canonical centers of
generalized pairs. As another application, we show that the image of an
anti-nef log canonical generalized pair has the structure of a numerically
trivial log canonical generalized pair. This readily implies a result of
Chen--Zhang. Along the way we prove that the Shokurov type convex sets for
anti-nef log canonical divisors are indeed rational polyhedral sets.Comment: 29 pages, to appear in Ann. Inst. Fourier (Grenoble
Constructing Fewer Open Cells by GCD Computation in CAD Projection
A new projection operator based on cylindrical algebraic decomposition (CAD)
is proposed. The new operator computes the intersection of projection factor
sets produced by different CAD projection orders. In other words, it computes
the gcd of projection polynomials in the same variables produced by different
CAD projection orders. We prove that the new operator still guarantees
obtaining at least one sample point from every connected component of the
highest dimension, and therefore, can be used for testing semi-definiteness of
polynomials. Although the complexity of the new method is still doubly
exponential, in many cases, the new operator does produce smaller projection
factor sets and fewer open cells. Some examples of testing semi-definiteness of
polynomials, which are difficult to be solved by existing tools, have been
worked out efficiently by our program based on the new method.Comment: Accepted by ISSAC 2014 (July 23--25, 2014, Kobe, Japan
- …
