Factorization of polynomials and GCD computations for finding universal denominators
From MaRDI portal
Publication:3589059
DOI10.1007/978-3-642-15274-0_2zbMATH Open1202.12004OpenAlexW1642587982MaRDI QIDQ3589059FDOQ3589059
Authors:
Publication date: 10 September 2010
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15274-0_2
Recommendations
- Denominators of rational solutions of linear difference systems of an arbitrary order
- Valuations of rational solutions of linear difference equations at irreducible polynomials
- Minimal universal denominators for linear difference equations
- Improved universal denominators
- The denominators of rational solutions to linear difference equations
Cites Work
- Problems of computer algebra involved in the search for polynomial solutions of linear differential and difference equations
- On the summation of rational functions
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Title not available (Why is that?)
- Title not available (Why is that?)
- Search for polynomial solutions of linear functional systems by means of induced recurrences
- Title not available (Why is that?)
- Rational solutions of linear differential and difference equations with polynomial coefficients
- Factoring polynomials and the knapsack problem
- Liouvillian solutions of irreducible second order linear difference equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integration of solutions of linear functional equations
- Valuations of rational solutions of linear difference equations at irreducible polynomials
- Modular algorithms in symbolic summation and symbolic integration
- Rational solutions of linear difference and \(q\)-differential equations with polynomial coefficients
- Indicial rational functions of linear ordinary differential equations with polynomial coefficients
Cited In (16)
- Difference integrability conditions for parameterized linear difference and differential equations
- Laurent, rational, and hypergeometric solutions of linear \(q\)-difference systems of arbitrary order with polynomial coefficients
- Particular solutions of linear differential and (\(q\)-) difference systems with hypergeometric right-hand sides
- On rational solutions of pseudo-linear systems
- Valuations of rational solutions of linear difference equations at irreducible polynomials
- Local improvements of lower bounds for valuations of solutions of linear difference systems with meromorphic coefficients
- Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order
- Search of rational solutions to differential and difference systems by means of formal series
- Minimal universal denominators for linear difference equations
- Rational solutions of linear difference equations: universal denominators and denominator bounds
- Detecting Nonexistence of Rational Solutions of Linear Difference Equations in Early Stages of Computation
- When the Search for Solutions Can Be Terminated
- Improved universal denominators
- Denominators of rational solutions of linear difference systems of an arbitrary order
- Linear differential and difference systems: \(\mathrm{EG}_\delta\)- and \(\mathrm{EG}_\sigma\)-eliminations
- Converging to Gosper's algorithm
Uses Software
This page was built for publication: Factorization of polynomials and GCD computations for finding universal denominators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589059)
