Computation of Euclidean minima in totally definite quaternion fields

T is the address of the current subterm (which is not closed, in general) : it is, therefore, an instruction pointer which runs along the term to be performed ; E is the

In these applications, the probability measures that are involved are replaced by uniform probability measures on discrete point sets, and we use our algorithm to solve the

Recently, some authors studied the coalescent process (or genealogical tree) of random size varying population; in this direction see [40] and [32] for branch- ing process, [27]

• the WRMC algorithm through Propositions 2.1 (consistency of the estimation), 2.2 (asymptotic normality), and 2.3 (a first partial answer to the initial question: Does waste

First, we mention that the numerical results satisfy the theoretical properties proved in [9] and in Theorem 1.3: the lack of triple points, the lack of triple points on the

From the limited evidence presented above, we might conjecture that the perfect numbers have density zero, while the abundant and deficient numbers each make up a positive proportion

In this article, we continue this tradition of tabulating automorphic forms on Shimura varieties by computing extensive tables of Hilbert modular cusp forms of parallel weight 2

innite words is reognized by a deterministi automaton with nal states and.. B uhi