1 Abstract Wolfe 1982 and Sato 1991 gave t wo diierent representations of a random variable X 1 with a self-decomposable distribution in terms of processes with independent increments. This paper shows how either of these representations follows easily from the other, and makes these representations more explicit when X 1 is either a rst or last passage time for a Bessel process.

Let G=(V,E) be a graph, a subset X of V is an interval of G whenever for a, b E X and xE V X , (a,x)EE (resp. (x,a)EE) if and only if (b,x)EE (resp. (x,b)EE). For instance, 0, {x}, where x E V, and V are intervals of G, called trivial intervals. A graph G is then said to be indecomposable when all of its intervals are trivial. In the opposite case, we will say that G is decomposable. We now int...

A continuum means comp6lct, connected metric space. A hereditarily unicoherent and arcwise connected continuum is called a dendroid. It follows that it is hereditarily decomposable ([2], (47), p. 239). A hereditarily unicoherent and hereditarily decomposable continuum is said to be a A.-dendroid. Thus, every dendroid is a }.-dendroid and an arcwise connected A.-dendroid is a dendroid. Note that...

Let p be a linear Zn action on C and let p also denote the induced Z„ action on S2p~l x D2q, D2p x S2q~l and S2p~l x S2q~l " 1m_1 where p = [m/2] and q = m — p. A free differentiable Zn action (£ , ju) on a homotopy sphere is p-decomposable if there is an equivariant diffeomorphism of (S2p~l x S2q~l, p) such that (S2m_1, ju) is equivalent to (£(*), ¿(*)) where S(*) = S2p_1 x D2q U^, D2p x S...

A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigra...

For homogeneous decomposable forms F (X) in n variables with integer coefficients, we consider the number of integer solutions x ∈ Zn to the inequality |F (x)| ≤ m as m → ∞. We give asymptotic estimates which improve on those given previously by the author in [T1]. Here our error terms display desirable behaviour as a function of the height whenever the degree of the form and the number of vari...

We give an explicit description of the law terminal value W additive martingales in a remarkable branching stable process. show that right tail probability decays exponentially fast and left follows ?logP(W<x)?12(logx)2 as x?0+. These are sharp contrast with results literature such Liu (2000, 2001) Buraczewski (2009). further is self-decomposable, therefore, possesses unimodal density. specify ...

The L-decomposable and the bi-decomposable models are two families of distributions on the set Sn of all permutations of the first n positive integers. Both of these models are characterized by collections of conditional independence relations. We first compute a Markov basis for the L-decomposable model, then give partial results about the Markov basis of the bi-decomposable model. Using these...

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of mu...