Related papers: Polynomials defined by tableaux and linear recurre…
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
The relation between the spectral decomposition of a self-adjoint operator which is realizable as a higher order recurrence operator and matrix-valued orthogonal polynomials is investigated. A general construction of such operators from…
Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
We establish a connection between a specialization of the nonsymmetric Macdonald polynomials and the Demazure characters of the corresponding affine Kac-Moody algebra. This allows us to obtain a representation-theoretical interpretation of…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…
We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
A general procedure which defines a partial ordering of cyclic permutations induced by continuous maps is known for constructing immediate successors to a cycle. We expound on this procedure in terms of labelled digraphs and characteristic…
This paper is devoted to characterizations classical orthogonal polynomials on quadratic lattices by using a matrix approach. In this form we recover the Hahn, Geronimus, Tricomi and Bochner type characterizations of classical orthogonal…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…