Displaying similar documents to “Convergence of gradient-based algorithms for the Hartree-Fock equations∗”

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...

Exponential deficiency of convolutions of densities

Iosif Pinelis (2012)

ESAIM: Probability and Statistics

Similarity:

If a probability density () ( ∈ ℝ) is bounded and := ∫e ()d < ∞ for some linear functional and all  ∈ (01), then, for each  ∈ (01) and all large enough , the -fold convolution of the -tilted density p ˜ t := e ()/ is bounded. This is a corollary of a general, “non-i.i.d.” result, which is also shown to enjoy a certain optimality property. Such results and their corollaries stated in terms of the absolute integrability of the corresponding characteristic...