{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:29Z","timestamp":1750307009954,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"1\/2","license":[{"start":{"date-parts":[[2012,7,23]],"date-time":"2012-07-23T00:00:00Z","timestamp":1343001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2012,7,23]]},"abstract":"Puiseux series are power series in which the exponents can be fractional and\/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series. Some are generalized to allow coefficients containing functions of the series variable that are dominated by any power of that variable, such as logarithms and nested logarithms of the series variable. Some computer algebra systems also have built-in or loadable functions that compute infinite Puiseux series. Unfortunately, there are some little-known pitfalls in computing Puiseux series. The most serious of these is expansions within branch cuts or at branch points that are incorrect for some directions in the complex plane. For example with each series implementation accessible to you.<\/jats:p>\n \n Compare the value of (\n z<\/jats:italic>\n 2<\/jats:sup>\n +\n z<\/jats:italic>\n 3<\/jats:sup>\n )\n 3\/2<\/jats:sup>\n with that of its truncated series expansion about\n z<\/jats:italic>\n = 0, approximated at\n z<\/jats:italic>\n = ?0.01. Does the series converge to a value that is the negative of the correct value?\n <\/jats:p>\n \n Compare the value of ln(\n z<\/jats:italic>\n 2<\/jats:sup>\n +\n z<\/jats:italic>\n 3<\/jats:sup>\n ) with its truncated series expansion about\n z<\/jats:italic>\n = 0, approximated at\n z<\/jats:italic>\n = ?0.01 + 0.1i. Does the series converge to a value that is incorrect by 2\u03c0\n i<\/jats:italic>\n ?\n <\/jats:p>\n \n Compare arctanh(?2 + ln(\n z<\/jats:italic>\n )\n z<\/jats:italic>\n ) with its truncated series expansion about\n z<\/jats:italic>\n = 0, approximated at\n z<\/jats:italic>\n = ?0.01. Does the series converge to a value that is incorrect by about \u03c0\n i<\/jats:italic>\n ?\n <\/jats:p>\n At the time of this writing, most implementations that accommodate such series exhibit such errors. This article describes how to avoid these errors both for manual derivation of series and when implementing series packages.<\/jats:p>","DOI":"10.1145\/2338496.2338503","type":"journal-article","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T14:41:09Z","timestamp":1343313669000},"page":"19-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Series crimes"],"prefix":"10.1145","volume":"46","author":[{"given":"David R.","family":"Stoutemyer","sequence":"first","affiliation":[{"name":"University of Hawaii, Honolulu, Hawaii"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/235699.235705"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362001.362023"},{"key":"e_1_2_1_3_1","first-page":"165","volume-title":"The State of the Art in Numerical Analysis","author":"Kahan W.","year":"1987","unstructured":"Kahan , W. , Branch cuts for complex elementary functions , in The State of the Art in Numerical Analysis , editors A. Iserles and M.J.D. Powell, Clarendon Press , 1987 , pp. 165 -- 212 . Kahan, W., Branch cuts for complex elementary functions, in The State of the Art in Numerical Analysis, editors A. Iserles and M.J.D. Powell, Clarendon Press, 1987, pp. 165--212."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/355656.355660"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429135.2429168"},{"key":"e_1_2_1_6_1","first-page":"361","volume-title":"Proceedings of the 1977 MACSYMA User's Conference, NASA CP-2012","author":"Zippel R.E.","unstructured":"Zippel , R.E. , Radical simplification made easy , in Proceedings of the 1977 MACSYMA User's Conference, NASA CP-2012 pp. 361 -- 367 . Zippel, R.E., Radical simplification made easy, in Proceedings of the 1977 MACSYMA User's Conference, NASA CP-2012 pp. 361--367."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2338496.2338503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2338496.2338503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:00Z","timestamp":1750236540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2338496.2338503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,23]]},"references-count":6,"journal-issue":{"issue":"1\/2","published-print":{"date-parts":[[2012,7,23]]}},"alternative-id":["10.1145\/2338496.2338503"],"URL":"https:\/\/doi.org\/10.1145\/2338496.2338503","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2012,7,23]]},"assertion":[{"value":"2012-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}