Denominator bounds for higher order systems of linear recurrence equations
DOI10.1145/3055282.3055298zbMATH Open1365.12003OpenAlexW2591799126WikidataQ131130514 ScholiaQ131130514MaRDI QIDQ5268830FDOQ5268830
Johannes Middeke, Carsten Schneider
Publication date: 21 June 2017
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055282.3055298
Recommendations
- Denominator bounds for systems of recurrence equations using \(\Pi\Sigma\)-extensions
- On simultaneous row and column reduction of higher-order linear differential systems
- On solutions of linear functional systems
- Denominator bounds and polynomial solutions for systems of \(q\)-recurrences over \(\mathbb{K}(t)\) for constant \(\mathbb{K}\)
- Denominators of rational solutions of linear difference systems of an arbitrary order
Symbolic computation and algebraic computation (68W30) Difference algebra (12H10) Numerical aspects of recurrence relations (65Q30) Numerical methods for difference equations (65Q10)
Cites Work
- Denominators of rational solutions of linear difference systems of an arbitrary order
- On solutions of linear ordinary difference equations in their coefficient field
- Summation in Finite Terms
- Fraction-free row reduction of matrices of Ore polynomials.
- Rational solutions of linear differential and difference equations with polynomial coefficients
- A collection of denominator bounds to solve parameterized linear difference equations in \(\Pi\Sigma\)-extensions
- Converging to Gosper's algorithm
This page was built for publication: Denominator bounds for higher order systems of linear recurrence equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268830)
