Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

New proofs of two $ q$-analogues of Koshy's formula


Authors: Emma Yu Jin and Markus E. Nebel
Journal: Proc. Amer. Math. Soc. 143 (2015), 5027-5042
MSC (2010): Primary 05A19
DOI: https://doi.org/10.1090/proc/12627
Published electronically: April 21, 2015
MathSciNet review: 3411124
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we prove a $ q$-analogue of Koshy's formula in terms of the Narayana polynomial due to Lassalle, and a $ q$-analogue of Koshy's formula in terms of $ q$-hypergeometric series due to Andrews, by applying the inclusion-exclusion principle on Dyck paths and on partitions. We generalize these two $ q$-analogues of Koshy's formula for $ q$-Catalan numbers to that for $ q$-Ballot numbers. This work also answers an open question by Lassalle and two questions raised by Andrews in 2010. We conjecture that if $ n$ is odd, then for $ m\ge n\ge 1$, the polynomial $ (1+q^n){m\brack n-1}_q$ is unimodal. If $ n$ is even, for any even $ j\ne 0$ and $ m\ge n\ge 1$, the polynomial $ (1+q^n)[j]_q{m\brack n-1}_q$ is unimodal. This implies the answer to the second problem posed by Andrews.


References [Enhancements On Off] (What's this?)

  • [1] George E. Andrews, The theory of partitions, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1998. Reprint of the 1976 original. MR 1634067 (99c:11126)
  • [2] George E. Andrews, On the difference of successive Gaussian polynomials, J. Statist. Plann. Inference 34 (1993), no. 1, 19-22. MR 1209986 (94f:11010), https://doi.org/10.1016/0378-3758(93)90030-A
  • [3] George E. Andrews, $ q$-Catalan identities, The legacy of Alladi Ramakrishnan in the mathematical sciences, Springer, New York, 2010, pp. 183-190. MR 2744261 (2012f:05018), https://doi.org/10.1007/978-1-4419-6263-8_10
  • [4] S. Brunetti, A. Del Lungo, and F. Del Ristoro, An equipartition property for the distribution of multiset permutation inversions, Adv. in Appl. Math. 27 (2001), no. 1, 41-50. MR 1835676 (2002c:05011), https://doi.org/10.1006/aama.2001.0725
  • [5] J. Cigler, Operatormethoden für $ q$-Identitäten. V. $ q$-Catalan-Bäume, Österreich. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II 205 (1996), 175-182 (1997) (German). MR 1601338 (98m:05013)
  • [6] J. Cigler, Some remarks about $ q$-Chebyshev polynomials and $ q$-Catalan numbers and related results, arXiv:1312.2767.
  • [7] George Gasper and Mizan Rahman, Basic hypergeometric series, 2nd ed., Encyclopedia of Mathematics and its Applications, vol. 96, Cambridge University Press, Cambridge, 2004. With a foreword by Richard Askey. MR 2128719 (2006d:33028)
  • [8] Thomas Koshy, Catalan numbers with applications, Oxford University Press, Oxford, 2009. MR 2526440 (2010g:05008)
  • [9] Christian Krattenthaler, Counting lattice paths with a linear boundary. II. $ q$-ballot and $ q$-Catalan numbers, Österreich. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II 198 (1989), no. 4-7, 171-199 (English, with German summary). MR 1064033 (92c:05020)
  • [10] Michel Lassalle, Narayana polynomials and Hall-Littlewood symmetric functions, Adv. in Appl. Math. 49 (2012), no. 3-5, 239-262. MR 3017958, https://doi.org/10.1016/j.aam.2012.06.002
  • [11] Vladimir N. Sachkov, Probabilistic methods in combinatorial analysis, Encyclopedia of Mathematics and its Applications, vol. 56, Cambridge University Press, Cambridge, 1997. Translated from the Russian; Revised by the author. MR 1453118 (98g:60022)
  • [12] Richard P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin. MR 1676282 (2000k:05026)
  • [13] Herbert S. Wilf, generatingfunctionology, 2nd ed., Academic Press, Inc., Boston, MA, 1994. MR 1277813 (95a:05002)
  • [14] Doron Zeilberger, The method of creative telescoping, J. Symbolic Comput. 11 (1991), no. 3, 195-204. MR 1103727 (92c:33005), https://doi.org/10.1016/S0747-7171(08)80044-2

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2010): 05A19

Retrieve articles in all journals with MSC (2010): 05A19


Additional Information

Emma Yu Jin
Affiliation: Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
Email: jin@cs.uni-kl.de

Markus E. Nebel
Affiliation: Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany – and – Department of Mathematics and Computer Science, University of Southern Denmark, Denmark
Email: nebel@cs.uni-kl.de

DOI: https://doi.org/10.1090/proc/12627
Received by editor(s): September 4, 2013
Received by editor(s) in revised form: March 19, 2014, and September 10, 2014
Published electronically: April 21, 2015
Additional Notes: The work of the first author was supported by research grants from DFG (Deutsche Forschungsgemeinschaft), JI 207/1-1.
Communicated by: Jim Haglund
Article copyright: © Copyright 2015 American Mathematical Society

American Mathematical Society