Related papers: On coefficients of Yablonskii-Vorob'ev polynomial

We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.

In the present paper we derive a new Hankel determinant representation for the square of the Vorob'ev-Yablonski polynomial $\mathcal{Q}_n(x),x\in\mathbb{C}$. These polynomials are the major ingredients in the construction of rational…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We construct one and two parameter deformations of the two dimensional Chebyshev polynomials with simple recurrence coefficients, following the algorithm in [3]. Using inverse scattering techniques, we compute the corresponding…

We give a concrete formula for the total Milnor number of the weighted-Le-Yomdin-at-infinity polynomial in most of the interesting cases. As an application, we give a description of the monodromy fibration at infinity for such kind of…

We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.

Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the…

The analogy between the nth power function and the nth Chebyshev polynomial is pursued, leading to consideration of Chebyshev radicals as analogous to ordinary radicals and Chebyshev exponents to ordinary exponents, and the cosine and…

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…

We give a simple proof of an explicit formula for Kerov polynomials. This formula is closely related to a formula of Goulden and Rattan.

We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…

We give formulas for the density of the measure of orthogonality for orthonormal polynomials with unbounded recurrence coefficients. The formulas involve limits of appropriately scaled Tur\'an determinants or Christoffel functions. Exact…

We look for spectral type differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].