Rizeng Chen
ABSTRACT
A decision algorithm for the first-order theory of univariate mixed trigonometric-polynomials over the reals is proposed in this paper. In the development of the decision algorithm, the concept "contraction mapping associated with an algebraic function" is introduced and a new real root isolation algorithm for univariate mixed trigonometric-polynomials is presented. The decision algorithm is implemented with Mathematica and its effectiveness is shown by some experimental results.
- Melanie Achatz, Scott McCallum, and Volker Weispfenning. 2008. Deciding polynomial-exponential problems. In Proceedings of the twenty-first international symposium on Symbolic and algebraic computation. 215–222.Google Scholar
Digital Library
- Hirokazu Anai and Volker Weispfenning. 2000. Deciding linear-trigonometric problems. In Proceedings of the 2000 international symposium on Symbolic and algebraic computation. 14–22.Google ScholarDigital Library
- Saugata Basu, Richard Pollack, and Marie-Françoise Coste-Roy. 2006. Algorithms in Real Algebraic Geometry. Springer, Berlin, Heidelberg.Google Scholar
- Russell Bradford, James H Davenport, Matthew England, Scott McCallum, and David Wilson. 2016. Truth table invariant cylindrical algebraic decomposition. Journal of Symbolic Computation 76 (2016), 1–35.Google ScholarDigital Library
- Christopher W Brown. 2001. Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation 32, 5 (2001), 447–465.Google ScholarDigital Library
- Bobby Forrester Caviness. 1970. On canonical forms and simplification. Journal of the ACM (JACM) 17, 2 (1970), 385–396.Google ScholarDigital Library
- Rizeng Chen, Haokun Li, Bican Xia, Tianqi Zhao, and Tao Zheng. 2023. Isolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial. https://doi.org/10.48550/ARXIV.2301.05847Google ScholarCross Ref
- Shiping Chen and Zhong Liu. 2020. Automated proof of mixed trigonometric-polynomial inequalities. Journal of Symbolic Computation 101 (2020), 318–329.Google ScholarCross Ref
- Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, and Roberto Sebastiani. 2018. Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions. ACM Transactions on Computational Logic (TOCL) 19, 3 (2018), 1–52.Google ScholarDigital Library
- George E Collins. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In Automata theory and formal languages. Springer, 134–183.Google Scholar
- George E Collins and Hoon Hong. 1991. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation 12, 3 (1991), 299–328.Google ScholarDigital Library
- James H. Davenport, Matthew England, Alberto Griggio, Thomas Sturm, and Cesare Tinelli. 2020. Symbolic computation and satisfiability checking. Journal of symbolic computation 100 (2020), 1–10.Google ScholarDigital Library
- Sicun Gao, Jeremy Avigad, and Edmund M Clarke. 2012. δ -complete decision procedures for satisfiability over the reals. In Automated Reasoning: 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings 6. Springer, 286–300.Google ScholarDigital Library
- Miklós Laczkovich. 2003. The removal of π from some undecidable problems involving elementary functions. Proc. Amer. Math. Soc. 131, 7 (2003), 2235–2240.Google ScholarCross Ref
- Angus Macintyre. 2016. Turing meets schanuel. Annals of Pure and Applied Logic 167, 10 (2016), 901–938.Google ScholarCross Ref
- Angus Macintyre and Alex J Wilkie. 1996. On the decidability of the real exponential field. KREISEL’S MATHEMATICS 115 (1996), 451.Google Scholar
- Yu V Matijasevič. 1973. On recursive unsolvability of Hilbert’s tenth problem. In Studies in Logic and the Foundations of Mathematics. Vol. 74. Elsevier, 89–110.Google Scholar
- Scott McCallum. 1984. An improved projection operator for cylindrical algebraic decomposition. Ph. D. Dissertation. University of Wisconsin-Madison.Google Scholar
- Scott McCallum and Volker Weispfenning. 2012. Deciding polynomial-transcendental problems. Journal of Symbolic Computation 47, 1 (2012), 16–31.Google ScholarDigital Library
- Daniel Richardson. 1969. Some undecidable problems involving elementary functions of a real variable. The Journal of Symbolic Logic 33, 4 (1969), 514–520.Google ScholarCross Ref
- Adam Strzeboński. 2008. Real root isolation for exp-log functions. In Proceedings of the twenty-first international symposium on Symbolic and algebraic computation. 303–314.Google ScholarDigital Library
- Adam Strzeboński. 2009. Real root isolation for tame elementary functions. In Proceedings of the 2009 international symposium on Symbolic and algebraic computation. 341–350.Google ScholarDigital Library
- Adam Strzeboński. 2011. Cylindrical decomposition for systems transcendental in the first variable. Journal of Symbolic Computation 46, 11 (2011), 1284–1290.Google ScholarDigital Library
- Adam Strzeboński. 2012. Real root isolation for exp–log–arctan functions. Journal of Symbolic Computation 47, 3 (2012), 282–314.Google ScholarDigital Library
- A. Tarski. 1951. A Decision Method for Elementary Algebra and Geometry. University of California Press.Google Scholar
- Lou van den Dries. 1984. Remarks on Tarski’s problem concerning (R,+,*, exp). In Studies in Logic and the Foundations of Mathematics. Vol. 112. Elsevier, 97–121.Google Scholar
- Seiichiro Wakabayashi. 2010. Remarks on semi-algebraic functions. https://www.math.tsukuba.ac.jp/ wkbysh/note4.pdf [Online; Posted April 5th, 2008, Revised August 30th, 2010].Google Scholar
- Paul S Wang. 1974. The undecidability of the existence of zeros of real elementary functions. Journal of the ACM (JACM) 21, 4 (1974), 586–589.Google ScholarDigital Library
Index Terms
- Deciding first-order formulas involving univariate mixed trigonometric-polynomials
Recommendations
A root isolation algorithm for sparse univariate polynomials
ISSAC '12: Proceedings of the 37th International Symposium on Symbolic and Algebraic ComputationWe consider a univariate polynomial f with real coefficients having a high degree N but a rather small number d + 1 of monomials, with d ≪ N. Such a sparse polynomial has a number of real root smaller or equal to d. Our target is to find for each real ...
Univariate real root isolation in multiple extension fields
ISSAC '12: Proceedings of the 37th International Symposium on Symbolic and Algebraic ComputationWe present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in Bα ∈ L[y], where L = Q(α1,..., αℓ) is an algebraic extension of the rational numbers. Our bounds are single ...
Isolating all the real roots of a mixed trigonometric-polynomial
AbstractMixed trigonometric-polynomials (MTPs) are functions of the form f ( x , sin x , cos x ) where f is a trivariate polynomial with rational coefficients, and the argument x ranges over the reals. In this paper, an algorithm “isolating” all the ...
Comments