Abstract
A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. The original proof is based on a inequality for hypergeometric functions. A generalization is presented.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alzer H., Gerhold S., Kauers M., Lupaş A.: On Turán’s inequality for Legendre polynomials. Expo. Math. 25(2), 181–186 (2007)
Amdeberhan T., Dixit A., Guan X., Jiu L., Moll V.: The unimodality of a polynomial coming from a rational integral: back to the original proof. J. Math. Anal. Appl. 420(2), 1154–1166 (2014)
Amdeberhan T., Moll V.: A formula for a quartic integral: a survey of old proofs and some new ones. Ramanujan J. 18(1), 91–102 (2009)
Boros, G., Moll, V.: A criterion for unimodality. Electron. J. Combin. 6, #R10 (1999)
Boros G., Moll V.: An integral hidden in Gradshteyn and Ryzhik. J. Comput. Appl. Math. 106(2), 361–368 (1999)
Boros G., Moll V.: A sequence of unimodal polynomials. J. Math. Anal. Appl. 237(1), 272–287 (1999)
Brown C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. Sigsam Bulletin 37(4), 97–108 (2003)
Caviness, B., Johnson, J.R.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, New York (1998)
Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: May, J.P. (ed.) ISSAC 2009 — Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 95–102. ACM, New York (2009)
Chen W.Y.C., Gu C.C.Y.: The reverse ultra log-concavity of the Boros-Moll polynomials. Proc. Amer. Math. Soc. 137(12), 3991–3998 (2009)
Chen W.Y.C., Xia E.X.W.: The ratio monotonicity of the Boros-Moll polynomials. Math. Comp. 78(268), 2269–2282 (2009)
Chen, W.Y.C., Xia, E.X.W.: 2-log-concavity of the Boros-Moll polynomials. Proc. Edinburgh Math. Soc. (2) 56(3), 701–722 (2013)
Chen, W.Y.C., Xia, E.X.W.: Proof of Moll’s minimum conjecture. European J. Combin. 34(4), 787–791 (2013)
Chyzak, F.: Fonctions holonomes en calcul formel. Thèse universitaire, École polytechnique (1998)
Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. Lecture Notes in Comput. Sci., Vol. 33, pp. 134–183. Springer, Berlin (1975)
Collins G.E., Hong H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symbolic Comput. 12(3), 299–328 (1991)
Dolzmann A., Sturm T.: Redlog: computer algebra meets computer logic. Sigsam Bulletin 31(2), 2–9 (1997)
Gerhold, S., Kauers, M.: A procedure for proving special function inequalities involvinga discrete parameter. In: Kauers, M. (ed.) Proceedings of ISSAC’05, pp. 156–162. ACM New York, NY (2005)
Gerhold, S., Kauers, M.: A computer proof of Turán’s inequality. J. Inequal. Pure Appl. Math. JIPAM. 7(2), Art. 42 (2006)
Kauers M.: SumCracker: a package for manipulating symbolic sums and related objects. J. Symbolic Comput. 41(9), 1039–1057 (2006)
Kauers, M.: Computer algebra and special function inequalities. In: Amdeberhan, T., Moll, V.H. (eds.) Tapas in Experimental Mathematics, pp. 215–235. Amer. Math. Soc., Providence, RI (2008)
Kauers, M.: How to use cylindrical algebraic decomposition. Sém. Lothar. Combin. 65, Art. B65a, 1–16 (2011)
Kauers M., Paule P.: A computer proof of Moll’s log-concavity conjecture. Proc. Amer. Math. Soc. 135(12), 3847–3856 (2007)
Kauers, M., Pillwein, V.: When can we detect that a P-finite sequence is positive? In: Watt, S. (ed.) Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pp. 195–202. ACM, New York (2010)
Koutschan, C.: HolonomicFunctions (User’s Guide). Technical Report 10-01, RISC Report Series, University of Linz, Austria (2010)
Manna D., Moll V.: A remarkable sequence of integers. Expo. Math. 27(4), 289–312 (2009)
Pillwein V.: Positivity of certain sums over Jacobi kernel polynomials. Adv. Appl. Math. 41(3), 365–377 (2008)
Pillwein, V.: Termination conditions for positivity proving procedures. In: Kauers, M. (ed.) Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp. 315–321. ACM, New York (2013)
Strzeboński A.: Solving systems of strict polynomial inequalities. J. Symbolic Comput. 29(3), 471–480 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dixit, A., Moll, V.H. & Pillwein, V. A Hypergeometric Inequality. Ann. Comb. 20, 65–72 (2016). https://doi.org/10.1007/s00026-015-0294-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-015-0294-5