We present a formula that expresses the Hankel determinants of a linear combination of length $d+1$ of moments of orthogonal polynomials in terms of a $dtimes d$ determinant of the orthogonal polynomials. This formula exists somehow hidden in the fol
klore of the theory of orthogonal polynomials but deserves to be better known, and be presented correctly and with full proof. We present four fundamentally different proofs, one that uses classical formulae from the theory of orthogonal polynomials, one that uses a vanishing argument and is due to Elouafi [J. Math. Anal. Appl. 431} (2015), 1253-1274] (but given in an incomplete form there), one that is inspired by random matrix theory and is due to Brezin and Hikami [Comm. Math. Phys. 214 (2000), 111-135], and one that uses (Dodgson) condensation. We give two applications of the formula. In the first application, we explain how to compute such Hankel determinants in a singular case. The second application concerns the linear recurrence of such Hankel determinants for a certain class of moments that covers numerous classical combinatorial sequences, including Catalan numbers, Motzkin numbers, central binomial coefficients, central trinomial coefficients, central Delannoy numbers, Schroder numbers, Riordan numbers, and Fine numbers.
The theme of this article is a reciprocity between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity manifests itself by the fact that the extension of the sequence of numbers of paths of length $n$, consis
ting of diagonal up- and down-steps and being confined to a strip of bounded width, to negative $n$ produces numbers of alternating sequences of integers that are bounded from below and from above. We show that this reciprocity extends to families of non-intersecting bounded up-down paths and certain arrays of alternating sequences which we call alternating tableaux. We provide as well weight
We explore some connections between moments of rescaled little q-Jacobi polynomials, q-analogues of values at negative integers for some Dirichlet series, and the q-Eulerian polynomials of wreath products of symmetric groups.
The sequence $A(n)_{n geq 0}$ of Apery numbers can be interpolated to $mathbb{C}$ by an entire function. We give a formula for the Taylor coefficients of this function, centered at the origin, as a $mathbb{Z}$-linear combination of multiple zeta valu
es. We then show that for integers $n$ whose base-$p$ digits belong to a certain set, $A(n)$ satisfies a Lucas congruence modulo $p^2$.
We prove evaluations of Hankel determinants of linear combinations of moments of orthogonal polynomials (or, equivalently, of generating functions for Motzkin paths), thus generalising known results for Catalan numbers.
We consider $m$-divisible non-crossing partitions of ${1,2,ldots,mn}$ with the property that for some $tleq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such non-crossing par
titions with prescribed number of blocks. Building on this result, we compute Chapotons $M$-triangle in this setting and conjecture a combinatorial interpretation for the $H$-triangle. This conjecture is proved for $m=1$.
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular sequence. We cons
ider then the following problem: describe the subsets n powersums forming a regular sequence. A necessary condition is that n! divides the product of the degrees of the elements. To find an easily verifiable sufficient condition turns out to be surprisingly difficult already in 3 variables. Given positive integers a<b<c with GCD(a,b,c)=1, we conjecture that p_a, p_b, p_c is a regular sequence for n=3 if and only if 6 divides abc. We provide evidence for the conjecture by proving it in several special instances.
We evaluate the determinant of a matrix whose entries are elliptic hypergeometric terms and whose form is reminiscent of Sylvester matrices. A hypergeometric determinant evaluation of a matrix of this type has appeared in the context of approximation
theory, in the work of Feng, Krattenthaler and Xu. Our determinant evaluation is an elliptic extension of their evaluation, which has two additional parameters (in addition to the base $q$ and nome $p$ found in elliptic hypergeometric terms). We also extend the evaluation to a formula transforming an elliptic determinant into a multiple of another elliptic determinant. This transformation has two further parameters. The proofs of the determinant evaluation and the transformation formula require an elliptic determinant lemma due to Warnaar, and the application of two $C_n$ elliptic formulas that extend Frenkel and Turaevs $_{10}V_9$ summation formula and $_{12}V_{11}$ transformation formula, results due to Warnaar, Rosengren, Rains, and Coskun and Gustafson.
Stankova and West showed that for any non-negative integer $s$ and any permutation $gamma$ of ${4,5,dots,s+3}$ there are as many permutations that avoid $231gamma$ as there are that avoid $312gamma$. We extend this result to the setting of words.
We evaluate Hankel determinants of matrices in which the entries are generating functions for paths consisting of up-steps, down-steps and level steps with a fixed starting point but variable end point. By specialisation, these determinant evaluation
s have numerous corollaries. In particular, one consequence is that the Hankel determinant of Motzkin prefix numbers equals 1, regardless of the size of the Hankel matrix.
