{"title":"Bounds for D-finite closure properties","authors":"Manuel Kauers","doi":"10.1145/2608628.2608634","DOIUrl":null,"url":null,"abstract":"We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves).","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2608628.2608634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves).