Related papers: On modified kernel polynomials and classical type …
In this contribution we consider sequences of monic polynomials orthogonal with respect to Sobolev-type inner product \[ \left\langle f,g\right\rangle _{\lambda,\mu}\!=\!\sum_{x=0}^Nf(x)g(x)\frac{\Gamma(N+1) p^x(1-p)^{N-x} }{\Gamma (N-x+1)…
Generalization of the Euler polynomials ${{A}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{m}^{n}}{{x}^{m}}}$ are the polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
We show that the normalised ultraspherical polynomials, $G_n^{(\lambda)}(x)=C_n^{(\lambda)}(x)/C_n^{(\lambda)}(1)$, satisfy the following stronger version of Tur\'{a}n inequality, $$|x|^\theta \left(G_n^{(\lambda)}(x)\right)^2…
It is known that the elementary symmetric polynomials $e_k(x)$ have the property that if $ x, y \in [0,\infty)^n$ and $e_k(x) \leq e_k(y)$ for all $k$, then $||x||_p \leq ||y||_p$ for all real $0\leq p \leq 1$, and moreover $||x||_p \geq…
We introduce orthogonal polynomials $M_j^{\mu,\ell}(x)$ as eigenfunctions of a certain self-adjoint fourth order differential operator depending on two parameters $\mu\in\mathbb{C}$ and $\ell\in\mathbb{N}_0$. These polynomials arise as…
The norm kernel of the generator-coordinate method is shown to be a symmetric kernel of an integral equation with eigenfunctions defined in the Fock--Bargmann space and forming a complete set of orthonormalized states (classified with the…
Various convergence results for the Bergman kernel of the Hilbert space of all polynomials in \C^{n} of total degree at most k, equipped with a weighted norm, are obtained. The weight function is assumed to be C^{1,1}, i.e. it is…
A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the…
Let $\cP_n$ be the space of homogeneous polynomials of degree $n$ on $\bbR^{m+1}$. We consider the asymptotic behavior of some coefficients relating to the decomposition of $\cP_n$ into the sum of $\SO(m+1)$-irreducible components. Using…
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…
We study polynomials that are orthogonal with respect to the modified Laguerre weight $z^{-n + \nu} e^{-Nz} (z-1)^{2b}$ in the limit where $n, N \to \infty$ with $N/n \to 1$ and $\nu$ is a fixed number in $\mathbb{R} \setminus…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…
Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…
In this paper we study the following hypergeometric polynomials: $\mathcal{P}_n(x) = \mathcal{P}_n(x;\alpha,\beta,\delta_1,\dots,\delta_\rho,\kappa_1,\dots,\kappa_\rho) = {}_{\rho+2} F_{\rho+1}…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…
The problem of resolving the fine details of a signal from its coarse scale measurements or, as it is commonly referred to in the literature, the super-resolution problem arises naturally in engineering and physics in a variety of settings.…