Related papers: Polynomial Divided Difference Operators Satisfying…
Differential properties for orthogonal polynomials in several variables are studied. We consider multivariate orthogonal polynomials whose gradients satisfy some quasi--orthogonality conditions. We obtain several characterizations for these…
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
It is shown how to define difference operators and equations on particular lattices $\{x_n\}$, $2n\in\mathbb{Z}$, such that the divided difference operator $(\mathcal{D}f)(x_{n+1/2})= (f(x_{n+1})-f(x_n))/(x_{n+1}-x_n)$ has the property that…
We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Different finite difference replacements for the derivative are analyzed in the context of the Heisenberg commutation relation. The type of the finite difference operator is shown to be tied to whether one can naturally consider $P$ and $X$…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
In this paper, we demonstrate an elementary method for constructing new solutions to Bochner's problem for matrix differential operators from known solutions. We then describe a large family of solutions to Bochner's problem, obtained from…
Formulas of Rodrigues-type for the Macdonald polynomials are presented. They involve creation operators, certain properties of which are proved and other conjectured. The limiting case of the Jack polynomials is discussed.
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…
In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…
Inspired by the framework of operational methods and based on the generating functions of Legendre-Gould Hopper polynomials and Sheffer sequences, we discuss certain new mixed type polynomials and their important properties. We show that…
Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…
We construct new families of conformally invariant differential operators acting on densities. We introduce a simple, direct approach which shows that all such operators arise via this construction when the degree is bounded by the…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
In this paper, we obtain the ladder operators and associated compatibility conditions for the type I and the type II multiple orthogonal polynomials. These ladder equations extend known results for orthogonal polynomials and can be used to…
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…
Given a chain of groups $G_0 \le G_1 \le G_2 ... $, we may form the corresponding chain of their representation rings, together with induction and restriction operators. We may let $\textrm{Res}^l$ denote the operator which restricts down…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…