Related papers: A fast algorithm for computing Bell polynomials ba…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
The aim of this paper is to introduce Bell polynomials and numbers of the second kind and poly-Bell polynomials and numbers of the second kind, and to derive their explicit expressions, recurrence relations and some identities involving…
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
In this paper, we consider central complete and incomplete Bell polynomials which are generalizations of the recently introduced central Bell polynomials and central analogues for the complete and incomplete Bell polynomials. We investigate…
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…
Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…
Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
The differential transform method is used to find numerical approximation of solution to a class of certain nonlinear differential algebraic equations. The method is based on Taylor's theorem. Coefficients of the Taylor series are…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
A new explicit closed-form formula for the multivariate $(n, k)$th partial Bell polynomial $B_{n,k} (x_1, x_2, ..., x_{n - k + 1})$ is deduced. The formula involves multiple summations and makes it possible, for the first time, to easily…
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…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…