This paper summarizes some known results about Appell polynomials and investigates their various analogs. The primary of these are the free Appell polynomials. In the multivariate case, they can be considered as natural analogs of the Appell polynomials among polynomials in non-commuting variables. They also fit well into the framework of free probability. For the free Appell polynomials, a number of combinatorial and "diagram" formulas are proven, such as the formulas for their linearization coefficients. An explicit formula for their generating function is obtained. These polynomials are also martingales for free Levy processes. For more general free Sheffer families, a necessary condition for pseudo-orthogonality is given. Another family investigated are the Kailath-Segall polynomials. These are multivariate polynomials, which share with the Appell polynomials nice combinatorial properties, but are always orthogonal. Their origins lie in the Fock space representations, or in the theory of multiple stochastic integrals. Diagram formulas are proven for these polynomials as well, even in the q-deformed case.
We introduce a new representation for the rescaled Appell polynomials and use it to obtain asymptotic expansions to arbitrary order. This representation consists of a finite sum and an integral over a universal contour (i.e. independent of the particular polynomials considered within the Appell family). We illustrate our method by studying the zero attractors for rescaled Appell polynomials. We also discuss the asymptotics to arbitrary order of the rescaled Bernoulli polynomials.
In this paper, we present a new real-valued Appell-type polynomial family $A_n^{(k)}(m,x), $ every member of which is expressed by mean of a generalized hypergeometric function. The generating exponential function of this type of polynomials is firstly discovered and the proof that they are of Appell-type ones is given. We present the differential operator formal power series representation as well as an explicit formula over the standard basis, and establish a new identity for the generalized hypergeometric function. Besides, we derive the addition, the multiplication and some other formulas …
We study Wronskians of Appell polynomials indexed by integer partitions. These families of polynomials appear in rational solutions of certain Painlevé equations and in the study of exceptional orthogonal polynomials. We determine their derivatives, their average and variance with respect to Plancherel measure, and introduce several recurrence relations. In addition, we prove an integrality conjecture for Wronskian Hermite polynomials previously made by the first and last authors. Our proofs all exploit strong connections with the theory of symmetric functions.
One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost automatically. The reason for that is just the proper framework of the generalized finite operator calculus recently being developed by the present author.
A polynomial family $\{p_n(x)\}$ is Appell if it is given by $\frac{e^{xt}}{g(t)} = \sum_{n=0}^\infty p_n(x)t^n$ or, equivalently, $p_n'(x) = p_{n-1}(x)$. If $g(t)$ is an entire function, $g(0)\neq 0$, with at least one zero, the asymptotics of linearly scaled polynomials $\{p_n(nx)\}$ are described by means of finitely zeros of $g$, including those of minimal modulus. As a consequence, we determine the limiting behavior of their zeros as well as their density. The techniques and results extend our earlier work on Euler polynomials.
The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the other two being free and tensor/classical probability). The basic properties of the Boolean Appell polynomials are described. In particular, their generating function turns out to have a resolvent-type form, just like the generating function for the free Sheffer polynomials. It follows that the Meixner (that is, Sheffer plus orthogonal) polynomial classes, …
We extend to the multivariate non-commutative context the descriptions of a "once-stripped" probability measure in terms of Jacobi parameters, orthogonal polynomials, and the moment generating function. The corresponding map Phi on states was introduced previously by Belinschi and Nica. We then relate these constructions to the c-free probability theory, which is a version of free probability for algebras with two states, introduced by Bozejko, Leinert, and Speicher. This theory includes as two extreme cases the free and Boolean probability theories. The main objects in the paper are the analo…
An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the Euler-MacLaurin summation formula. Grâce à une généralisation de la théorie de l'algèbre des logarithmes itérés, on definit un analogue logarithmique des suites de polynômes de Sheffer et d'Appell. Quelques exemples d'applications permettent de déduire la formule de Stirling ainsi qu'un version logarithmique de la formule de sommation de Euler--MacLaurin.
Classical Gončarov polynomials are polynomials which interpolate derivatives. Delta Gončarov polynomials are polynomials which interpolate delta operators, e.g., forward and backward difference operators. We extend fundamental aspects of the theory of classical bivariate Gončarov polynomials and univariate delta Gončarov polynomials to the multivariate setting using umbral calculus. After introducing systems of delta operators, we define multivariate delta Gončarov polynomials, show that the associated interpolation problem is always solvable, and derive a generating function (an Appell relati…
We establish a relation between the Bollobas-Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a duality formula for the relative Tutte polynomial of dual plane graphs and an expression of the Kauffman bracket of a virtual link as a specialization of the relative Tutte polynomial.
The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the identified edges. A formula to compute the Tutte polynomial of a tensor product of graphs was originally given by Brylawski. This formula was recently generalized to colored graphs and the generalized Tutte polynomial introduced by Bollobás and Riordan. In this paper we generalize the colored tensor product formula to relative Tutte polynomials of relative graphs…
Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$- and/or $Q$-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple $\mathbb{C}$-algebra associated with each vertex of an association scheme. We compute explicitly the Fisher type lower bounds on the sizes of relative $t$-designs, assuming that certain irreducible modules behave nice…
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the Ehrhart polynomial of a given relative polytopal complex is a Hilbert function in Steingrimsson's sense. We use this result to establish that the modular and integral flow and tension polynomials of a graph are Hilbert functions.
We introduce the concept of a relative Tutte polynomial of colored graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this subject. We then apply the relative Tutte polynomial to virtual knot theory. More specifically, we show that the Kauffman bracket polynomial (hence the Jones polynomial) of a virtual knot can be computed from the relative Tutte polynomial of its face (Tait) graph with some suitable variable substitutions. Our method offers an alternative to the ribbon graph app…
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature of this algorithm allows us to show combinatorial invariance of relative Kazhdan-Lusztig polynomials in the Hermitian symmetric space setting.
This article is devoted to the number of non-negative solutions of the linear Diophantine equation $$ a_1t_1+a_2t_2+... a_nt_n=d, $$ where $a_1, ..., a_n$, and $d$ are positive integers. We obtain a relation between the number of solutions of this equation and characters of the symmetric group, using {\em relative symmetric polynomials}. As an application, we give a necessary and sufficient condition for the space of the relative symmetric polynomials to be non-zero.
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible ones (irreducible but reducible over an extension field). One approach employs generating functions, another one uses a combinatorial method. They yield exact formulas and approximations with relative errors that essentially decrease exponentially in the input size.
We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d is large enough. We extend this result to generalized Severi varieties parametrizing plane curves which, in addition, satisfy tangency conditions of given orders with respect to a given line. We show that the degrees of these varieties, appropriately rescaled, are given by a combinatorially defined "relative node polynomial" in the tangency orders, provided …
In this paper, we study genus $0$ equivariant relative Gromov-Witten invariants of $\mathbb{P}^1$ whose corresponding relative stable maps are totally ramified over one point. For fixed number of marked points, we show that such invariants are piecewise polynomials in some parameter space. The parameter space can then be divided into polynomial domains, called chambers. We determine the difference of polynomials between two neighboring chambers. In some special chamber, which we called the totally negative chamber, we show that such a polynomial can be expressed in a simple way. The chamber st…
Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial, and when $n=3$, $P_{pqr}(x)$ is $(1-x)$ times the $pqr$-th cyclotomic polynomial.) Let the height of a polynomial be the maximum absolute value of one of its coefficients. It is well known that the height of $Φ_{pq}(x)$ is 1, and Gallot and Moree showed that the same is true for $P_{pqr}(x)$ when $n=3$. We show that the coefficients of $P_N(x)$ depend mainly …
