Related papers: On coefficients of Yablonskii-Vorob'ev polynomial
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
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 study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
We describe a variation of Dworks unit-root method to determine the degree four Frobenius polynomial for members of a 1-modulus Calabi-Yau family over $\mathbb{P}^1$ in terms of the holomorphic period near a point of maximal unipotent…
By using p-adic q-integrals, we study the q-Bernoulli numbers and polynomials of higher order.
In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…
Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…
We calculate the zeros of an exponential polynomial of three 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 obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
The Gelfond-Khovanskii residue formula computes the sum of the values of any Laurent polynomial over solutions of a system of Laurent polynomial equations whose Newton polytopes have sufficiently general relative position. We discuss two…
The aim of this paper is to study the fully degenerate Bernoulli polynomials and numbers, which are a degenerate version of Bernoulli polynomials and numbers and arise naturally from the Volkenborn integral of the degenerate exponential…
In this paper we use Faa di Bruno's formula to associate Bell polynomial values to differential equations of the form $y^{\prime}=f(y)$. That is, we use partial Bell polynomials to represent the solution of such an equation and use the…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
In response to [6], we discover the looked for inversion formula for F-nomial coefficients. Before supplying its proof, we generalize F-nomial coefficients to multi F-nomial coefficients and we give their combinatorial interpretation in…
We present lower bounds for the orbit length of reduction modulo primes of parametric polynomial dynamical systems defined over the integers, under a suitable hypothesis on its set of preperiodic points over $\mathbb C$. Applying recent…
We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…