Related papers: Umbral nature of the Poisson random variables
We propose new algorithms for generating $k$-statistics, multivariate $k$-statistics, polykays and multivariate polykays. The resulting computational times are very fast compared with procedures existing in the literature. Such speeding up…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
Matrix-form Poisson probability distributions were recently introduced as one matrix generalization of Panjer distributions. We show in this paper that under the constraint that their representation is to be nonnegative, they have a…
We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…
The use of algebraic tools of operational and umbral nature is exploited to develop a new point of view and to extend the theory of Hermite polynomials, with more than one variable also of complex nature. The techniques we adopt includes…
The aim of this paper is to investigate generating functions for modification of the Milne-Thomson's polynomials, which are related to the Bernoulli polynomials and the Hermite polynomials. By applying the Umbral algebra to these generating…
We introduce (quantum) twist automorphisms for upper cluster algebras and cluster Poisson algebras with coefficients. Our constructions generalize the twist automorphisms for quantum unipotent cells. We study their existence and their…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
We use some properties of orthogonal polynomials to provide a class of upper/lower variance bounds for a function $g(X)$ of an absolutely continuous random variable $X$, in terms of the derivatives of $g$ up to some order. The new bounds…
Gibbs-type exchangeable random partitions, which is a class of multiplicative measures on the set of positive integer partitions, appear in various contexts, including Bayesian statistics, random combinatorial structures, and stochastic…
It is shown that the operator space generated by peripheral eigenvectors of a unital completely positive map on a von Neumann algebra has a $C^*$-algebra structure. This extends the notion of non-commutative Poisson boundary by including…
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain…
In this note, we compute the Mellin transform of a Poissonian exponential functional, the underlying process being a simple continuous time random walk. It shows that the Poissonian functional can be expressed in term of the inverse of a…
We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method…
We give a new presentation for the partition algebras. This presentation was discovered in the course of establishing an inductive formula for the partition algebra Jucys-Murphy elements defined by Halverson and Ram [European J. Combin. 26…
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…
Following the ideas of Rosenbloom [7] and Hayman [5], Luis B\'aez-Duarte gives in [1] a probabilistic proof of Hardy-Ramanujan's asymptotic formula for the partitions of an integer. The main principle of the method relies on the convergence…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…