Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems
نویسندگان
چکیده
منابع مشابه
Digits and Continuants in Euclidean Algorithms. Ergodic versus Tauberian Theorems
We obtain new results regarding the precise average{ case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The ...
متن کاملErgodic Algorithms on Special Euclidean Groups for
The variabilities in orientations and positions of rigid objects can be modeled by applying rotation and translation groups on their surface manifolds. Following the deformable template theory the rigid templates, given by two-dimensional surface descriptions, are rotated and translated to conform to individual objects in a particular scene. The fundamental group generating rigid motion is spec...
متن کاملTauberian theorems for sum sets
Introduction. The sums formed from the set of non-negative powers of 2 are just the non-negative integers. It is easy to obtain “abelian” results to the effect that if a set is distributed like the powers of 2, then the sum set will be distributed like Dhe non-negative integers. We will be concerned here with converse, or “Tauberian” results. The main theme of this paper is t’he following quest...
متن کاملTauberian Theorems for Summability Transforms
we then write sn → s(A), where A is the A method of summability. Appropriate choices of A= [an,k] for n,k ≥ 0 give the classical methods [2]. In this paper, we present various summability analogs of the strong law of large numbers (SLLN) and their rates of convergence in an unified setting, beyond the class of random-walk methods. A convolution summability method introduced in the next section ...
متن کاملErgodic Theorems
Every one of the important strong limit theorems that we have seen thus far – the strong law of large numbers, the martingale convergence theorem, and the ergodic theorem – has relied in a crucial way on a maximal inequality. This is no accident: it can in fact be shown that a maximal inequality is a necessary condition for an almost everywhere convergence theorem. We will refrain from carrying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2000
ISSN: 1246-7405
DOI: 10.5802/jtnb.296