arXiv subjects
Publications and source records attributed to Jingjun Han.
We show Fujita's spectrum conjecture for $ε$-log canonical pairs and Fujita's log spectrum conjecture for log canonical pairs. Then, we generalize the pseudo-effective threshold of a single divisor to multiple divisors and establish the analogous finiteness and the DCC properties.
In this paper, we study the relationship between iterated resultant and multivariate discriminant. We show that, for generic form $f(X_n)$ with even degree $d$, if the polynomial is squarefreed after each iteration, the multivariate discriminant $Δ(f)$ is a factor of the squarefreed iterated resultant. In fact, we find a factor $Hp(f,[x_1,\ldots,x_n])$ of the squarefreed iterated resultant, and prove that the multivariate discriminant $Δ(f)$ is a factor of $Hp(f,[x_1,\ldots,x_n])$. Moreover, we conjecture that $Hp(f,[x_1,\ldots,x_n])=Δ(f)$ holds for generic form $f$, and show that it is true for generic trivariate form $f(x,y,z)$.
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.
Let $\xx_n=(x_1,\ldots,x_n)$ and $f\in \R[\xx_n,k]$. The problem of finding all $k_0$ such that $f(\xx_n,k_0)\ge 0$ on $\mathbb{R}^n$ is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial. For solving the problems, we propose a simplified Brown's CAD projection operator, \Nproj, of which the projection scale is always no larger than that of Brown's. For many problems, the scale is much smaller than that of Brown's. As a result, the lifting phase is also simplified. Some new algorithms based on \Nproj\ for solving those problems are designed and proved to be correct. Comparison to some existing tools on some examples is reported to illustrate the effectiveness of our new algorithms.
Quantifier elimination of positive semidefinite cyclic ternary quartic forms is studied in this paper. We solve the problem by the theory of complete discrimination systems, function \RealTriangularize in Maple15 and the so-called Criterions on Equality of Symmetric Inequalities method. The equivalent simple quantifier-free formula is proposed and is difficult to obtain automatically by previous methods or quantifier elimination tools.