This is a small contribution to the (September 15, 2019) Liber Amicorum Richard Dick Allen Askey. At the end a positivity conjecture related to the First and Second Borwein Conjectures is offered.
We prove a general quadratic formula for basic hypergeometric series, from which simple proofs of several recent determinant and Pfaffian formulas are obtained. A special case of the quadratic formula is actually related to a Gram determinant formula for Askey-Wilson polynomials. We also show how to derive a recent double-sum formula for the moments of Askey-Wilson polynomials from Newtons interpolation formula.
In this joint introduction to an Asterisque volume, we give a short discussion of the historical developments in the study of nonlinear covering groups, touching on their structure theory, representation theory and the theory of automorphic forms. This serves as a historical motivation and sets the scene for the papers in the volume. Our discussion is necessarily subjective and will undoubtedly leave out the contributions of many authors, to whom we apologize in earnest.
Motivated by the Gaussian symplectic ensemble, Mehta and Wang evaluated the $n$ by $n$ determinant $det((a+j-i)Gamma(b+j+i))$ in 2000. When $a=0$, Ciucu and Krattenthaler computed the associated Pfaffian $Pf((j-i)Gamma(b+j+i))$ with an application to the two dimensional dimer system in 2011. Recently we have generalized the latter Pfaffian formula with a $q$-analogue by replacing the Gamma function by the moment sequence of the little $q$-Jacobi polynomials. On the other hand, Nishizawa has found a $q$-analogue of the Mehta--Wang formula. Our purpose is to generalize both the Mehta-Wang and Nishizawa formulae by using the moment sequence of the little $q$-Jacobi polynomials. It turns out that the corresponding determinant can be evaluated explicitly in terms of the Askey-Wilson polynomials.
This is a supplement for Pearls in graph theory -- a textbook written by Nora Hartsfield and Gerhard Ringel. Probabilistic method, Deletion-contraction formulas, Matrix theorem, Graph-polynomials, Generating functions, Minimum spanning trees, Marriage theorem and its relatives, Toroidal graphs, Rado graph.
In this paper, we discuss coin-weighing problems that use a 5-way scale which has five different possible outcomes: MUCH LESS, LESS, EQUAL, MORE, and MUCH MORE. The 5-way scale provides more information than the regular 3-way scale. We study the problem of finding two fake coins from a pile of identically looking coins in a minimal number of weighings using a 5-way scale. We discuss similarities and differences between the 5-way and 3-way scale. We introduce a strategy for a 5-way scale that can find both counterfeit coins among $2^k$ coins in $k+1$ weighings, which is better than any strategy for a 3-way scale.