Publications
📄 Total 0
🔗 DOI 0
✍ arXiv 0
💻 GitHub 0

💡 Click the title to fold/unfold abstract

1
Mathematics of Computations, 95(360), pp. 2025-2059.
In this paper, we revisit the problem of computing a cylindrical algebraic decomposition from a more geometric perspective, where the construction is related to the study of morphisms between real varieties. It is showed that the geometric fiber cardinality (geometric property) decides the existence of semi-algebraic continuous sections (semi-algebraic property). As a result, all equations can be systematically exploited in the projection phase, leading to a new simple algorithm whose efficiency is demonstrated by experimental results.
2
Preprint, arXiv:2602.21708.
In this paper, we establish a new criterion for covering maps between real algebraic varieties. Specifically, we prove that a quasi-finite, flat morphism with locally constant geometric fibers between varieties over a real closed field induces a covering map on the real points in the Euclidean topology. This result provides an effective method for verifying covering properties, as we demonstrate that the required conditions can be checked algorithmically using the tools developed in this work.
3
Preprint, arXiv:2509.25820.
This paper studies stratifications of the discriminant hypersurface. We showed that for the general monic univariate polynomial of fixed degree n, its higher branch loci in the coefficient space defined by sub-discriminants can be found by the branch locus defined by the discriminant.
4
Preprint, arXiv:2502.05834.
This paper proposes a new family of morphisms between varieties, namely the q-étale morphisms (= flat + finitely and constantly many geometric points in fibers). It is shown in the paper that q-étale morphisms become finite étale after reduction, therefore induce covering maps on the real points for real varieties.
ACM Communications in Computer Algebra, 58(3), pp. 67-71.
This is a short explanation of the work "a geometric approach to cylindrical algebraic decomposition", firstly presented in ISSAC'24 poster session.
5
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation (pp. 56-64).
This paper shows that reduction can be widely performed in a class of problems called "Trigonometric Extension".
6
Journal of Symbolic Computation, 121, 102250.
This paper is about a real root isolation algorithm for rational univariate mixed trigonometric-polynomials.
7
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (pp. 145-154).
This paper is about the first-order theory of univariate mixed trigonometric-polynomials. We showed that this theory is surprisingly unconditionally decidable.