A comparison of algorithms for proving positivity of linearly recurrent sequences
From MaRDI portal
Publication:2109988
DOI10.1007/978-3-031-14788-3_15OpenAlexW4299831618MaRDI QIDQ2109988
Veronika Pillwein, Philipp Nuspl
Publication date: 21 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_15
Related Items (1)
Uses Software
Cites Work
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- On the positivity of the Gillis-Reznick-Zeilberger rational function
- Positivity of certain sums over Jacobi kernel polynomials
- Positivity of third order linear recurrence sequences
- Occurrence of zero in a linear recursive sequence
- Partial cylindrical algebraic decomposition for quantifier elimination
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Effective asymptotics of linear recurrences with rational coefficients
- SumCracker: A package for manipulating symbolic sums and related objects
- Positivity of second order linear recurrent sequences
- Ore Polynomials in Sage
- Integral D-Finite Functions
- When can we detect that a P-finite sequence is positive?
- Termination conditions for positivity proving procedures
- Bounds for D-finite closure properties
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- QEPCAD B
- A procedure for proving special function inequalities involving a discrete parameter
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A comparison of algorithms for proving positivity of linearly recurrent sequences
