In this paper, we introduce the idea of generalized relative order (respectively generalized relative lower order) of entire functions of two complex variables. Hence, we study some growth properties of entire functions of two complex variables on the basis of the definition of generalized relative order and generalized relative lower order of entire functions of two complex variables.

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...

Sentential adverbs are often assumed to be situated in front of the verb phrase in arbitrary order. In a recent monograph, however, Cinque (1999) claims that the relative order of sentential adverbs may, in principle, be universally fixed. In this paper I first give a brief presentation of Cinque’s proposal. Then I present a pilot study of sentential adverbs in English and Swedish. This study i...

The pancake problem is a famous search problem where the objective is to sort a sequence of objects (pancakes) through a minimal number of prefix reversals (flips). The best approaches for the problem are based on heuristic search with abstraction (pattern database) heuristics. We present a new class of abstractions for the pancake problem called relative-order abstractions. Relative-order abst...

Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.

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.

We consider a natural generalization of the concept order an element in group [Formula: see text]: text] is said to have subgroup (respectively, coset text]) if first strictly positive integer such that text]). study this notion and its algorithmic properties realm free groups some related families. Both negative (algorithmic) results emerge setting. On side, among other results, we prove eleme...