Sur les caractères minéralogiques et stratigraphiques des roches dites plutoniennes de la Belgique et de l'Ardenne française

Mode of access: Internet

Fronts and interfaces in bistable extended mappings

We study the interfaces' time evolution in one-dimensional bistable extended dynamical systems with discrete time. The dynamics is governed by the competition between a local piece-wise affine bistable mapping and any couplings given by the convolution with a function of bounded variation. We prove the existence of travelling wave interfaces, namely fronts, and the uniqueness of the corresponding selected velocity and shape. This selected velocity is shown to be the propagating velocity for any interface, to depend continuously on the couplings and to increase with the symmetry parameter of the local nonlinearity. We apply the results to several examples including discrete and continuous couplings, and the planar fronts' dynamics in multi-dimensional Coupled Map Lattices. We eventually emphasize on the extension to other kinds of fronts and to a more general class of bistable extended mappings for which the couplings are allowed to be nonlinear and the local map to be smooth.Comment: 27 pages, 3 figures, submitted to Nonlinearit

Close to Uniform Prime Number Generation With Fewer Random Bits

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.L. Montgomery, made precise by Friedlander and Granville; then the Extended Riemann Hypothesis; and finally fully unconditionally using the Barban-Davenport-Halberstam theorem. We argue that this approach has a number of desirable properties compared to previous algorithms.Comment: Full version of ICALP 2014 paper. Alternate version of IACR ePrint Report 2011/48