Related papers: An urn model for the Jacobi-Pi\~neiro polynomials
Urn models have been widely studied and applied in both scientific and social science disciplines. In clinical studies, the adoption of urn models in treatment allocation schemes has been proved to be beneficial to both researchers, by…
Krall-type polynomials are orthogonal polynomials for a Stieltjes' measure obtained by adding jumps at the boundary of the interval of orthogonality of either the generalized Laguerre polynomials or the Jacobi polynomials. We show that both…
Multivariate Bessel and Jacobi processes describe Calogero-Moser-Sutherland particle models. They depend on a parameter $k$ and are related to time-dependent classical random matrix models like Dysom Brownian motions, where $k$ has the…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…
It is known that Bernoulli scheme of independent trials with two outcomes is connected with the binomial coefficients. The aim of this paper is to indicate stochastic processes which are connected with the $q$-polynomial coefficients (in…
We introduce a class of so-called Pl$\ddot{\mathrm{u}}$cker polynomials with respect to $2l\times l$ matrices, which varies the standard quadratic Pl$\ddot{\mathrm{u}}$cker expression by increased power and twisted linear forms. Besides…
The spectral measure for the two families of orthogonal polynomial systems related to periodic chains with N-particle elementary unit and nearest neighbour harmonic interaction is computed using two different methods. The interest is in the…
In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
In this paper, we will deal with some new formulae for two product Genocchi polynomials together with both Euler polynomials and Bernoulli polynomials. We get some applications for Genocchi polynomials. Our applications possess a number of…
In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively…
Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
Classical Jacobi polynomials $P_{n}^{(\alpha,\beta)}$, with $\alpha, \beta>-1$, have a number of well-known properties, in particular the location of their zeros in the open interval $(-1,1)$. This property is no longer valid for other…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.
We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
We investigate the convexity problem for the Parisi functional defined on the space of the so-called functional ordered parameters in the Sherrington-Kirkpatrick model. In the recent work of Panchenko [3], he proved that this functional is…