Gorav Jindal
ABSTRACT
This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as , is defined as the minimum exponent of x that has a non-zero coefficient in f(x). Our first result is that the order of the Wronskian of these power series is equivalent up to a polynomial factor, to the maximum order which occurs in the linear combination of these power series. This implies that the Wronskian approach used in (Kayal and Saha, TOCT’2012) to upper bound the order of sum of square roots is optimal up to a polynomial blowup. We also demonstrate similar upper bounds, similar to those of (Kayal and Saha, TOCT’2012), for the order of power series in a variety of other scenarios. We also solve a special case of the inequality testing problem outlined in (Etessami et al., TOCT’2014).
In the second part of the paper, we study the equality variant of the sum of square roots problem, which is decidable in polynomial time due to (Blömer, FOCS’1991). We investigate a natural generalization of this problem when the input integers are given as straight line programs. Under the assumption of the Generalized Riemann Hypothesis (GRH), we show that this problem can be reduced to the so-called “one dimensional” variant. We identify the key mathematical challenges for solving this “one dimensional” variant.
- Eric Allender, Peter Buergisser, Johan Kjeldgaard-Pedersen, and Peter Bro Miltersen. 2009. On the Complexity of Numerical Analysis. SIAM J. Comput. 38, 5 (2009), 1987–2006. https://doi.org/10.1137/070697926 arXiv:https://doi.org/10.1137/070697926Google Scholar
Digital Library
- Eric Bach and Jeffrey Shallit. 1996. Algorithmic Number Theory. MIT Press, Cambridge, MA, USA.Google ScholarDigital Library
- A. Baker. 1998. Logarithmic forms and the abc- conjecture. De Gruyter, Berlin, New York, 37–44.Google Scholar
- A. Baker and G. Wüstholz. 1993. Logarithmic forms and group varieties.Journal für die reine und angewandte Mathematik 442 (1993), 19–62. http://eudml.org/doc/153550Google Scholar
- Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, and James Worrell. 2022. Identity Testing for Radical Expressions. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (Haifa, Israel) (LICS ’22). Association for Computing Machinery, New York, NY, USA, Article 8, 11 pages. https://doi.org/10.1145/3531130.3533331Google ScholarDigital Library
- Johannes Blömer. 1991. Computing Sums of Radicals in Polynomial Time. In 32nd Annual Symposium on Foundations of Computer Science, 1-4 October 1991. IEEE Computer Society, San Juan, Puerto Rico, 670–677. https://doi.org/10.1109/SFCS.1991.185434Google ScholarDigital Library
- Johannes Blömer. 1998. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98, Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, and Geppino Pucci (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 151–162.Google Scholar
- Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. 1997. Complexity and Real Computation. Springer-Verlag, Berlin, Heidelberg.Google Scholar
- Eric Boniface, Wei Deng, and J. Maurice Rojas. 2022. Trinomials and Deterministic Complexity Limits for Real Solving. arXiv:2202.06115Google Scholar
- Alin Bostan and Philippe Dumas. 2010. Wronskians and linear independence. The American Mathematical Monthly 117, 8 (2010), 722–727.Google ScholarCross Ref
- Richard P Brent. 1976. Fast multiple-precision evaluation of elementary functions. Journal of the ACM (JACM) 23, 2 (1976), 242–251.Google ScholarDigital Library
- Kousha Etessami, Alistair Stewart, and Mihalis Yannakakis. 2014. A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing. ACM Trans. Comput. Theory 6, 2 (2014), 9:1–9:23. https://doi.org/10.1145/2601327Google ScholarDigital Library
- M. R. Garey, R. L. Graham, and D. S. Johnson. 1976. Some NP-Complete Geometric Problems. In Proceedings of the Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pennsylvania, USA) (STOC ’76). Association for Computing Machinery, New York, NY, USA, 10–22. https://doi.org/10.1145/800113.803626Google ScholarDigital Library
- Neeraj Kayal and Chandan Saha. 2012. On the Sum of Square Roots of Polynomials and Related Problems. ACM Trans. Comput. Theory 4, 4, Article 9 (nov 2012), 15 pages. https://doi.org/10.1145/2382559.2382560Google ScholarDigital Library
- Martin Kneser. 1975. Lineare Abhängigkeit von Wurzeln. Acta Arithmetica 26, 3 (1975), 307–308. http://eudml.org/doc/205320Google ScholarCross Ref
- Pascal Koiran. 2019. Root separation for trinomials. Journal of Symbolic Computation 95 (2019), 151–161. https://doi.org/10.1016/j.jsc.2019.02.004Google ScholarDigital Library
- Gregorio Malajovich. 2001. An Eective Version of Kronecker’s Theorem on Simultaneous Diophantine Approximation. Technical Report. Technical report, City University of Hong Kong.Google Scholar
- Jianbo Qian and Cao An Wang. 2006. How much precision is needed to compare two sums of square roots of integers?Inform. Process. Lett. 100, 5 (2006), 194–198. https://doi.org/10.1016/j.ipl.2006.05.002Google ScholarDigital Library
- Jean-Pierre Serre. 1981. Quelques applications du théoreme de densité de Chebotarev. Publications Mathématiques de l’IHÉS 54 (1981), 123–201.Google ScholarCross Ref
- Peter Stevenhagen and Hendrik Willem Lenstra. 1996. Chebotarëv and his density theorem. The Mathematical Intelligencer 18, 2 (1996), 26–37.Google ScholarCross Ref
- M Voorhoeve and A.J Van Der Poorten. 1975. Wronskian determinants and the zeros of certain functions. Indagationes Mathematicae (Proceedings) 78, 5 (1975), 417–424. https://doi.org/10.1016/1385-7258(75)90050-5Google ScholarCross Ref
Index Terms
- On the Order of Power Series and the Sum of Square Roots Problem
Recommendations
On the Sum of Square Roots of Polynomials and Related Problems
The sum of square roots over integers problem is the task of deciding the sign of a nonzero sum, S = ∑i=1n δi · √ai, where δi ∈ {+1, −1} and ai’s are positive integers that are upper bounded by N (say). A fundamental open question in numerical analysis ...
An extremal problem and an estimation of the Wronskian of certain Jacobi polynomials
We study an extremal problem related to "splitted" Jacobi weights: for α,β>0, find the largest value of maxx -1,1](1+x)βpm(x)2+(1-x)αqn(x)2] among all polynomials pm and qn of degree at most m and n, respectively, satisfying -11(1+x)βpm(x)2+(1-x)αqn(x)2]...
Multivariate linear recurrences and power series division
Bousquet-Mélou and Petkovšek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their results by means of division theorems for formal power series, which clarifies the ...
Comments