Related papers: A new recursion for Bressoud's polynomials
In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.
This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients…
We show that Laurent biorthogonal polynomials whose defining three-term recurrence have constant coefficients have coefficient arrays that are Riordan arrays. For each such family of Laurent biorthogonal polynomials we associate in a…
We obtain closed form expressions for convolutions of scale transformations within a certain subset of Appell polynomials. This subset contains the Bernoulli, Apostol-Euler, and Cauchy polynomials, as well as various kinds of their…
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…
The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…
In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.
Quite recently, Bremner et al. introduced a new approach to Rota's Classification Problem and classified some (new) operated polynomial identities. In this paper, we prove that all operated polynomial identities classified by Bremner et al.…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We highlight the role of q-series techniques in proving identities arising from knot theory. In particular, we prove Rogers-Ramanujan type identities for alternating knots as conjectured by Garoufalidis, Le and Zagier.
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching…
We prove polynomial identities for the N=1 superconformal model SM(2,4\nu) which generalize and extend the known Fermi/Bose character identities. Our proof uses the q-trinomial coefficients of Andrews and Baxter on the bosonic side and a…
Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…
We prove a result about reducibility behaviour of Thue polynomials over the rationals that was conjectured by M\"uller. More precisely, we show that, apart from few explicitly given exceptions, these polynomials have only finitely many…
We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…
The Rogers-Ramanujan identities are investigated using the Cauchy identity for Schur functions.
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…