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

Institut für Symbolisches Rechnen

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

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.

Originalsprache	Englisch
Titel	Proceedings of ISSAC 2011
Herausgeber*innen	Anton Leykin
Seiten	201-208
Seitenumfang	8
DOIs	https://doi.org/10.1145/1993886.1993919
Publikationsstatus	Veröffentlicht - 2011

Wissenschaftszweige

101001 Algebra
101002 Analysis
101 Mathematik
102 Informatik
102011 Formale Sprachen
101009 Geometrie
101013 Mathematische Logik
101020 Technische Mathematik
101025 Zahlentheorie
101012 Kombinatorik
101005 Computeralgebra
101006 Differentialgeometrie
101003 Angewandte Geometrie
102025 Verteilte Systeme

JKU-Schwerpunkte

Computation in Informatics and Mathematics

Zugriff auf Dokument

10.1145/1993886.1993919

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@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 -