In the paper we establish some new results depending on the comparative growth properties of composition of entire functions using relative $L^{ast }$-order (relative $L^{ast }$-lower order) as compared to their corresponding left and right factors where $Lequiv Lleft( rright) $ is a slowly changing function.

‎the aim of this paper is to study distribution of ratios of generalized order statistics from pareto distribution. parameter estimation of pareto distribution based on generalized order statistics and ratios of them have been obtained. inferences using method of moments and unbiased estimator have been obtained to develop point estimations. consistency of unbiased estimator has been illustrate...

in this paper, we introduce the idea of relative order and type of entire functions represented by banach valued dirichlet series of two complex variables to generalize some earlier results.proving some preliminary theorems on the relative order, we obtain sum and product theorems and we show that the relative order of an entire function represented by dirichlet series is the same as that of it...

algebraic frames are generalizations of fourier transforms on locally compact abelian groups in the sense that the family of vectors forming the frame are replaced by a family of unbounded linear functionals. the paper studies the indexing measure space of the algebraic frames; as the investigation narrows down to the class of lower semiframes, more relations are revealed between the discret...

In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX(d) and CX′(d) when X ′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges ...

The standard measure for the quality of online algorithms is competitive ratio. This generally applicable, and some problems it works well, but others fails to distinguish between that have very different performance. Thus, ever since its introduction, researchers worked on improving measure, defining variants, or measures based other concepts improve situation. Relative worst-order analysis (R...

We show that the naive mean-field approximation correctly predicts leading term of logarithmic lower tail probabilities for number copies a given subgraph in G(n,p) and arithmetic progressions length random subsets integers entire range densities where is viable. Our main technical result provides sufficient conditions on maximum degrees uniform hypergraph H guarantee edges, induced by binomial...