In this paper, we study some growth properties of entire functions represented by a vector valued Dirichlet series on the basis of generalized relative Ritt order and generalized relative Ritt lower order.

In this paper, we introduce the idea of generalized Ritt type and generalised Ritt weak type of entire functions represented by a vector valued Dirichlet series. Hence, we study some growth properties of two entire functions represented by a vector valued Dirichlet series on the basis of generalized Ritt type and generalised Ritt weak type.

for entire functions, the notions of their growth indicators such as ritt order are classical in complex analysis. but the concepts of relative ritt order of entire functions and as well as their technical advantages of not comparing with the growths of $exp exp z$ are not at all known to the researchers of this area. therefore the studies of the growths of entire functions in the light of thei...

For entire functions, the notions of their growth indicators such as Ritt order are classical in complex analysis. But the concepts of relative Ritt order of entire functions and as well as their technical advantages of not comparing with the growths of $exp exp z$ are not at all known to the researchers of this area. Therefore the studies of the growths of entire functions in the light of thei...

In 1922, J. F. Ritt [13] proved two remarkable theorems on decompositions of polynomial maps of C[x] into irreducible polynomials (with respect to the composition ◦ of maps). Briefly, the first theorem states that in any two decompositions of a given polynomial function into irreducible polynomials the number of the irreducible polynomials and their degrees are the same (up to order). The secon...

Ritt-Wu’s algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangulari...

We present an algorithm to determine the set of essential singular solutions of a differential equation. Essential singular solutions can be informally described as follows: the general solution of a differential equation is usually described as a solution depending on a number of arbitrary constants equal to the order of the differential equation. The essential singular solutions are those tha...