On the positivity of the Gillis-Reznick-Zeilberger rational function
From MaRDI portal
Publication:670644
DOI10.1016/j.aam.2018.11.003zbMath1408.33041OpenAlexW2903148028WikidataQ128825715 ScholiaQ128825715MaRDI QIDQ670644
Publication date: 18 March 2019
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2018.11.003
Symbolic computation and algebraic computation (68W30) Combinatorial inequalities (05A20) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items
Positivity problem of three-term recurrence sequences, A comparison of algorithms for proving positivity of linearly recurrent sequences
Uses Software
Cites Work
- Unnamed Item
- Complete monotonicity for inverse powers of some combinatorially defined polynomials
- A fast algorithm for proving terminating hypergeometric identities
- Positivity of certain sums over Jacobi kernel polynomials
- On Turán's inequality for Legendre polynomials
- A holonomic systems approach to special functions identities
- The method of creative telescoping
- Convolution structures for Laguerre polynomials
- Über gewisse Potenzreihen mit lauter positiven Koeffizienten
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Solving systems of strict polynomial inequalities
- Positivity of rational functions and their diagonals
- Symbolic summation assists combinatorics
- Termination conditions for positivity proving procedures
- On Elementary Methods in Positivity Theory
- GFUN
- An extension of Turán's inequality
- A procedure for proving special function inequalities involving a discrete parameter
- An efficient procedure deciding positivity for a class of holonomic functions
- A Computer Proof of Moll’s Log-Concavity Conjecture
