Related papers: Polynomials defined by tableaux and linear recurre…

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Sch\"{u}tzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from…

We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…

Using the action of the Yang-Baxter elements of the Hecke algebra on polynomials, we define two bases of polynomials in n variables. The Hall-Littlewood polynomials are a subfamily of one of them. For q=0, these bases specialize into the…

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…

In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…

We prove certain duality properties and present recurrence relations for a four-parameter family of self-dual Koornwinder-Macdonald polynomials. The recurrence relations are used to verify Macdonald's normalization conjectures for these…

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.

This paper studies the properties of Demazure atoms and characters using linear operators and also tableaux-combinatorics. It proves the atom-positivity property of the product of a dominating monomial and an atom, which was an open…

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…

Kohnert polynomials are polynomials indexed by unit cell diagrams in the first quadrant defined earlier by the author and Searles that give a common generalization of Schubert polynomials and Demazure characters for the general linear…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…