• The Mathematical Education
• /
• v.29 no.1
• /
• pp.55-61
• /
• 1990

There are three objectives of this paper. First, we present an elegant and simple generalization of Abel's theorem (i .e. tile Abel summability (on the unit disk of the euclidean plane) is regular). Second, we consider the definition of Abel summability through lim (equation omitted) which immediately has clear connexctions with CeSARO summability and Cesaro sums (equation omitted). This approach examplifies some simple aspects of so-called Tauberian theorems of divergent series. Third, we present the applications of the previous results to find the limits of transition probabilities of homogeneous Marker chain. Finally, we explain why the original Abel's theorem which looks obvious is difficult to be proved, and can not be proved analytically.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.157-172
• /
• 2004

An age-dependent branching process where disasters occur as a renewal process leading to annihilation or survival of all the cells, is considered. For such a process, the total mean sojourn time of all the cells in the system is analysed using the regeneration point technique. The mean number of cells which die in time t and its asymptotic behaviour are discussed. When the disasters arrival as a Poisson process and the lifetime of the cells follows exponential distribution, elegant inter- relationships are found among the means of (i) the total number of cells which die in time t (ii) the total sojourn time of all cells in the system upto time t and (iii) the number of living cells at time t. Some of the existing results are deduced as special cases for related processes.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.115-123
• /
• 2004

A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to layoff participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.