Related papers: Bijections behind the Ramanujan Polynomials

Lascoux polynomials are $K$-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux ($\mathsf{RSVT}$) rule for Lascoux polynomials and reverse semistandard Young…

$\hat{Z}$-invariants, which can reconstruct the analytic continuation of the SU(2) Chern-Simons partition functions via Borel resummation, were discovered by GPV and have been conjectured to be a new homological invariant of 3-manifolds…

We give four examples of families of orthogonal polynomials for which the coefficients in the recurrence relation satisfy a discrete Painlev\'e equation. The first example deals with Freud weights $|x|^\rho \exp(-|x|^m)$ on the real line,…

Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingr\'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation…

In the first part we establish a connection between the Euler-Maclaurin summation formula and the Rota-Baxter functional equation. In the second part we give a simple proof of a formula, due to Ramanujan, on the summation of certain…

We consider orthogonal polynomials p_n with respect to an exponential weight function w(x) = exp(-P(x)). The related equations for the recurrence coefficients have been explored by many people, starting essentially with Laguerre [49], in…

We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…

We prove a positivity result for interpolation polynomials that was conjectured by Knop and Sahi. These polynomials were first introduced by Sahi in the context of the Capelli eigenvalue problem for Jordan algebras, and were later shown to…

In his study of Ramanujan-Sato type series for $1/\pi$, Sun introduced a sequence of polynomials $S_n(q)$ as given by $$S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k,$$ and he conjectured that the polynomials…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

The Baxter number can be written as $B_n = \sum_0^n \Theta_{k,n-k-1}$. These numbers have first appeared in the enumeration of so-called Baxter permutations; $B_n$ is the number of Baxter permutations of size $n$, and $\Theta_{k,l}$ is the…

The Ramanujan $_1\psi_1$ summation theorem in studied from the perspective of $q$-Jackson integrals, $q$-difference equations and connection formulas. This is an approach which has previously been shown to yield Bailey's very-well-poised…

Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

The systematic study of inversion sequences avoiding triples of relations was initiated by Martinez and Savage. For a triple $(\rho_1,\rho_2,\rho_3)\in\{<,>,\leq,\geq,=,\neq,-\}^3$, they introduced $\I_n(\rho_1,\rho_2,\rho_3)$ as the set of…

We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…

In 1960 R\'enyi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of $n$ distinct objects. In each query one selects a random subset of labels and asks, which…

Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in $\mathfrak{S}_n$ with respect to the parity of its descents and ascents. In recent work, Pan and Zeng proved a $q$-analogue of…

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…