2014/08/23 by Manuel Kauers, Kauers, Manuel · 5 citations
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #I.1.2 #Symbolic Computation (cs.SC) #cs.SC #graph theory and CDMA systems #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1408.5514
arxiv created 2014/08/23 · openalex publication_date 2014/08/23 · arxiv updated 2014/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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).