表紙

As we have said in section 1 (Introduction), using the mentioned tree T , Barioli and Fallat gave the first example for which the equivalence between the problem of ordered

Furthermore, we characterize the bounded and compact multiplication operators between L w and the space L ∞ of bounded functions on T and determine their operator norm and

We denote by Rec(Σ, S) (and budRec(Σ, S)) the class of tree series over Σ and S which are recognized by weighted tree automata (respectively, by bottom- up deterministic weighted

Q discrep : Predefined empirical constant corresponding to the minimum value of the module of total discrepancy between estimated gas supply volumes, which is of practical

The time span from the slot where an initial collision occurs up to and including the slot from which all transmitters recognize that all packets involved in the above initial

The paper is organized as follows: in Section 2 is presented the necessary back- ground on fragmentation processes and real trees, culminating with Proposition 2.7, which gives a

Some of the above approximation algorithms for the MSC include a proce- dure for partitioning a minimum spanning tree T ∗ of a given graph into k trees of the graph as uniformly

The intention of this work is to generalise the limiting distribution results for the Steiner distance and for the ancestor-tree size that were obtained for the special case of