سند علمی

Hybrid Proofs of the q-Binomial Theorem and Other Identities

چکیده

We give “hybrid” proofs of the q-binomial theorem and other identities. The proofs are “hybrid” in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the Identity Theorem) to prove the full version. We prove three somewhat unusual summation formulae, and use these to give hybrid proofs of a number of identities due to Ramanujan. Finally, we use these new summation formulae to give new partition interpretations of the Rogers-Ramanujan identities and the RogersSelberg identities.

اسناد مشابه

  • The q-Binomial Theorem and two Symmetric q-Identities

    سند علمی۲۰۰۳Electr. J. Comb.Victor J. W. Guo

    We notice two symmetric q-identities, which are special cases of the transformations of 2φ1 series in Gasper and Rahman’s book (Basic Hypergeometric Series, Cambridge University Press, 1990, p. 241). In this paper, we give combinatorial proofs of these two identities and the q-bi

  • A Noncommutative Weight-dependent Generalization of the Binomial Theorem

    سند علمی۲۰۱۲MICHAEL J. SCHLOSSER

    A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For two special cases of the weight function, i

  • A Computer Proof of a Polynomial Identity Implying a Partition Theorem of Göllnitz

    سند علمی۲۰۰۱Alexander Berkovich, Axel Riese

    In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer proofs are done with the aid of the new com

  • CPU-GPU Hybrid Parallel Binomial American Option Pricing

    سند علمی۲۰۱۲Nan Zhang, Chi-Un Lei

    We present in this paper a novel parallel binomial algorithm that computes the price of an American option. The algorithm partitions a binomial tree constructed for the pricing into blocks of multiple levels of nodes, and assigns each such block to multiple processors. Each of th

  • Proof Nets and the Identity of Proofs

    سند علمی۲۰۰۶CoRRLutz Straßburger

    These are the notes for a 5-lecture-course given at ESSLLI 2006 in Malaga, Spain. The URL of the school is http://esslli2006.lcc.uma.es/. This version slightly differs from the one which has been distributed at the school because typos have been removed and comments and suggestio

  • Applications of operator identities to the multiple q-binomial theorem and q-Gauss summation theorem

    مقاله‌ی دسترسی آزاد۲۰۰۶Discrete MathematicsZhizhengZhang, MaixueLiu