{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:06:25Z","timestamp":1648883185480},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2011,1,28]]},"abstract":"\n Given a system\n P<\/jats:italic>\n of\n n<\/jats:italic>\n linear ordinary differential polynomial parametric equations (linear DPPEs) in\n n<\/jats:italic>\n -1 differential parameters, we proved in [2] that if nonzero a differential resultant gives the implicit equation of\n P<\/jats:italic>\n . Differential resultants often vanish under specialization, which prevented us from giving an implicitization algorithm in [2]. Motivated by Canny's method and its generalizations we consider now a linear perturbation of\n P<\/jats:italic>\n and use it to give an algorithm to decide if the dimension of the implicit ideal of\n P<\/jats:italic>\n is\n n<\/jats:italic>\n -1 and in the affirmative case obtain the implicit equation of\n P<\/jats:italic>\n . This poster presentation will contain this development together with examples illustrating the results. An extended version of this work can be found in [1].\n <\/jats:p>","DOI":"10.1145\/1940475.1940501","type":"journal-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:01Z","timestamp":1297171261000},"page":"136-137","source":"Crossref","is-referenced-by-count":0,"title":["Linear differential implicitization and differential resultants"],"prefix":"10.1145","volume":"44","author":[{"given":"Sonia L.","family":"Rueda","sequence":"first","affiliation":[{"name":"E.T.S. Arquitectura, Univ. Polit\u00e9cnica de Madrid, Madrid, Spain"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","unstructured":"S.L. Rueda A perturbed differential resultant based implicitization algorithm for linear DPPEs. (2010) arXiv:1003.4375v1. 10.1016\/j.jsc.2011.05.001 S.L. Rueda A perturbed differential resultant based implicitization algorithm for linear DPPEs. (2010) arXiv:1003.4375v1. 10.1016\/j.jsc.2011.05.001"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2009.09.003"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1940475.1940501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T14:20:06Z","timestamp":1613917206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940475.1940501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,28]]},"references-count":2,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2011,1,28]]}},"alternative-id":["10.1145\/1940475.1940501"],"URL":"http:\/\/dx.doi.org\/10.1145\/1940475.1940501","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"published":{"date-parts":[[2011,1,28]]}}}