A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

Manuel Kauers; Carsten Schneider

doi:10.1145/1993886.1993919

A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

Research Institute for Symbolic Computation

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we have introduced the distinction between periodic and aperiodic factors in the denominator, and we have given an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.

Original language	English
Title of host publication	Proceedings of ISSAC 2011
Editors	Anton Leykin
Pages	201-208
Number of pages	8
DOIs	https://doi.org/10.1145/1993886.1993919
Publication status	Published - 2011

Fields of science

101001 Algebra
101002 Analysis
101 Mathematics
102 Computer Sciences
102011 Formal languages
101009 Geometry
101013 Mathematical logic
101020 Technical mathematics
101025 Number theory
101012 Combinatorics
101005 Computer algebra
101006 Differential geometry
101003 Applied geometry
102025 Distributed systems

JKU Focus areas

Computation in Informatics and Mathematics

Access to Document

10.1145/1993886.1993919

Cite this

@inproceedings{07646816721341e0875d5b564b90db24,

title = "A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations",

abstract = "We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we have introduced the distinction between periodic and aperiodic factors in the denominator, and we have given an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.",

author = "Manuel Kauers and Carsten Schneider",

year = "2011",

doi = "10.1145/1993886.1993919",

language = "English",

isbn = "978-1-4503-0675-1",

pages = "201--208",

editor = "\{Anton Leykin\}",

booktitle = "Proceedings of ISSAC 2011",

}

TY - GEN

T1 - A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

AU - Kauers, Manuel

AU - Schneider, Carsten

PY - 2011

Y1 - 2011

N2 - We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we have introduced the distinction between periodic and aperiodic factors in the denominator, and we have given an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.

AB - We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we have introduced the distinction between periodic and aperiodic factors in the denominator, and we have given an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.

UR - https://www.scopus.com/pages/publications/79959661173

U2 - 10.1145/1993886.1993919

DO - 10.1145/1993886.1993919

M3 - Conference proceedings

SN - 978-1-4503-0675-1

SP - 201

EP - 208

BT - Proceedings of ISSAC 2011

A2 - Anton Leykin, null

ER -

A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

Abstract

Fields of science

JKU Focus areas

Access to Document

Other files and links

Cite this