• Keine Ergebnisse gefunden

Multianvil High-Pressure Synthesis and Crystal Structure of

N/A
N/A
Protected

Academic year: 2022

Aktie "Multianvil High-Pressure Synthesis and Crystal Structure of"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Multianvil High-Pressure Synthesis and Crystal Structure of

-YbBO

3

Hubert Huppertz

Department Chemie, Ludwig-Maximilians-Universit¨at M¨unchen, Butenandtstraße 5-13 (Haus D), 81377 M¨unchen, Germany

Reprint requests to Dr. H. Huppertz. E-mail: huh@cup.uni-muenchen.de Z. Naturforsch.56 b,697–703 (2001); received April 5, 2001

Multianvil, High-Pressure Synthesis, Borates

-Ytterbium borate (-YbBO3) was synthesized under high-pressure in a Walker-type mul- tianvil apparatus at 2.2 GPa and 1400C. The title-compound crystallizes in the trigonal calcite structure, space group R¯3c. Single crystal X-ray data yielded a = 492.1(2), c = 1630.5(9) pm, wR2 = 0.0344 for 165 F2values and 11 variable parameters. Within the trigonal planar BO3

groups the B-O distance is 137.8(4) pm. The ytterbium atoms have a slightly distorted octahedral oxygen coordination (Yb-O: 224.4(2) pm).

Referenzen

ÄHNLICHE DOKUMENTE

(b) Begr¨ unden Sie kurz, warum {¬·} nicht funktional vollst¨ andig ist.. (c) Begr¨ unden Sie kurz, warum {¬·} funktional vollst¨ andig f¨ ur einstellige

Zeigen Sie, dass es zu jeder Formel ϕ eine ¨ aquivalente termreduzierte Formel gibt, dessen Gr¨ oße linear in der Gr¨ oße von ϕ beschr¨ ankt ist..

eine Formel- menge Γ eine Eigenschaft des Universum ausdr¨ uckt, wenn f¨ ur jede Menge U gilt: Die Eigenschaft trifft auf U zu gdw.. es ein Modell von

Wenn ja, begr¨ unden Sie dies, wenn nicht, dann geben Sie jeweils ein k an, so dass der Duplikator das Spiel G N,A i n f¨ ur alle i ≤ k, aber der Spoiler das Spiel G N k+1 ,A

Exercise 8-1 Recall the definition of the group Z ∗ N and that its order, i.e.. Use an appropriate encoding. Recall the chapter on the modes of operation of block ciphers...

Assume for simplicity that a transaction consists just of the amount x of money to be transferred (and ignore account numbers and the like). The amount x is encoded by the group

Exercise 10-2 The RSA hardness assumption states that P (RSA-inv A (n) = 1) ≤ negl(n) for any probilistic polynomial time adversary A. Show that the RSA hardness assumption implies

The distinguisher D is a probabilistic polynomial time algorithm, so it can make at most polynomially many different requests to the oracle function, say with arguments x