A comparison of algorithms for proving positivity of linearly recurrent sequences

DOI10.1007/978-3-031-14788-3_15MaRDI QIDQ2109988zbMATH OpenOpenAlexFDO

Authors Philipp Nuspl, Veronika Pillwein

Publication date 21 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-14788-3_15

zbMATH Keywords

inequalitiesdifference equationsholonomic sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• scientific article; zbMATH DE number 3823893 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 1254237 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1973372 (Why is no real title available?)
• A procedure for proving special function inequalities involving a discrete parameter
• Algorithms in real algebraic geometry
• Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
• Bounds for D-finite closure properties
• Effective asymptotics of linear recurrences with rational coefficients
• Integral D-finite functions
• Occurrence of zero in a linear recursive sequence
• On proving inequalities by cylindrical algebraic decomposition
• On the positivity of the Gillis-Reznick-Zeilberger rational function
• Ore polynomials in Sage
• Partial cylindrical algebraic decomposition for quantifier elimination
• Positivity of certain sums over Jacobi kernel polynomials
• Positivity of second order linear recurrent sequences
• Positivity of third order linear recurrence sequences
• Positivity problems for low-order linear recurrence sequences
• QEPCAD B
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• SumCracker: A package for manipulating symbolic sums and related objects
• Termination conditions for positivity proving procedures
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• When can we detect that a P-finite sequence is positive?

Cited in

(2)

• An algorithm for proving arbitrary identities involving linear recurrence sequences
• Order bounds for C2-finite sequences

Describes a project that uses

Uses Software

• GeneratingFunctions
• Arb
• OEIS
• SumCracker
• SageMath
• QEPCAD
• DLMF

This page was built for publication: A comparison of algorithms for proving positivity of linearly recurrent sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109988)