Related papers: Dembowski-Ostram polynomials and reversed Dickson …

In this work the existence of solutions of one-dimensional backward dou- bly stochastic differential equations (BDSDEs in short) where the coefficient is left-Lipschitz in y (may be discontinuous) and Lipschitz in z is studied. Also, the…

We propose a way to find the asymptotic distribution of zeros of orthogonal polynomials p_n(x) satisfying a difference equation of the form B(x)p_n(x+\delta)-C(x,n)p_n(x)+D(x)p_n(x-\delta)=0. We calculate the asymptotic distribution of…

The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…

We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

The aim of this paper is to study degenerate Eulerian polynomials and degenerate Eulerian numbers, respectively as degenerate versions of the Eulerian polynomials and the Eulerian numbers, and to derive some of their properties.…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Rational solutions of the fourth order analogue to the Painlev'e equations are classified. Special polynomials associated with the rational solutions are introduced. The structure of the polynomials is found. Formulas for their coefficients…

In this paper, we provide a local method to find compositional inverses of all PPs, some new PPs and their compositional inverses are given.

We investigate the symmetric Dunkl-classical orthogonal polynomials by using a new approach applied in connection with the Dunkl operator. The main aim of this technique is to determine the recurrence coefficients first and foremost. We…

The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…

We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…

We obtain strong converse inequalities for the Bernstein polynomials with explicit asymptotic constants. We give different estimation procedures in the central and non-central regions of [0,1]. The main ingredients in our approach are the…

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.

Positive polynomials arising from Muirhead's inequality, from classical power mean and elementary symmetric mean inequalities and from Minkowski's inequality can be rewritten as sums of squares.

In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…