We introduce a new indicator for dynamical systems, the averaged number of visits, to estimate the frequency of visits in small regions, when a map is iterated up to the inverse of the measure of this region. We compute this quantity analytically and numerically for various systems and we show

Abstract. A repetition is an important property of a string. In this paper we consider the average number of occurrences of primitively rooted repetitions in necklace. First, we define circular square and circular run for a string and show the average number of them. Using these results, we obtain

from that pilot exercise, but also to explore a number of additional aims, we have conducted a second study. Aims and methods A main objective was to see if evidence of progressive learning could be obtained. The 17 trainees appointed at September 1972 in the North-east Scotland region agreed to record

Abstract not found

Abstract not found

ABSTRACT. A maximal vector of a set ~s one which is not less than any other vector m all components We derive a recurrence relation for computing the average number of maxunal vectors m a set of n vectors m d-space under the assumpUon that all (nl) a relative ordermgs are equally probable. Solving

Abstract We present an analytical and empirical study of the max-imal and average numbers of stable extensions in abstract argumenta-tion frameworks. As one of the analytical main results, we prove a tight upper bound on the maximal number of stable extensions that depends only on the number

. We present an algorithm with the average number of flips, needed to sort a stack of n burnt pancakes, equal to 7n/4 + O(1) and a randomized algorithm for the unburnt version with at most 17n/12 + O(1) flips on average. In addition, we show that in the burnt version, the average number of flips of any

Abstract. We show that, on average, the number of octahedral newforms of prime level is bounded by a constant. 1.

Abstract not found