Learn More
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Lau-rent formal power series with coefficients in a finite field. We especially consider approximations by rational functions whose denominators are powers of irreducible polynomials, and study the(More)
  • J. Aaronson, H. Nakada, O. Sarig, O. SARIG
  • 2004
Let Ω be a Borel subset of S N where S is countable. A measure is called exchangeable on Ω, if it is supported on Ω and is invariant under every Borel automorphism of Ω which permutes at most finitely many coordinates. De-Finetti's theorem characterizes these measures when Ω = S N. We apply the ergodic theory of equivalence relations to study the case Ω = S(More)
In a recent paper, the first and third author proved a central limit theorem for the number of coprime solutions of the diophantine approximation problem for formal Laurent series in the setting of the classical theorem of Khintchine. In this note, we consider a more general setting and show that even an invariance principle holds, thereby improving upon(More)
Evolutions of single-particle energies and Z = 64 sub-shell along the isotonic chain of N = 82 are investigated in the density dependent relativistic Hartree-Fock (DDRHF) theory in comparison with other commonly used mean field models such as Skyrme HF, Gogny HFB and density dependent relativistic Hartree model (DDRMF). The pairing is treated in the BCS(More)
We present a new method by which wavefunctions with simple structure are renormalized so as to contain more complicated structure. This method, called H n –cooling method, is applied to the study of the quadrupole collective motion of 56 Fe, 54 Cr, 58 Fe and 56 Cr. The shell-model wavefunctions of lowest-lying states of these nuclei are well treated by this(More)
This paper studies digit-cost functions for the Euclid algorithm on polynomials with coefficients in a finite field, in terms of the number of operations performed on the finite field Fq. The usual bit-complexity is defined with respect to the degree of the quotients; we focus here on a notion of 'fine' complexity (and on associated costs) which relies on(More)