𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Remark about the Point Interaction in one Dimension

✍ Scribed by Dr. P. Šeba

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
226 KB
Volume
499
Category
Article
ISSN
0003-3804

No coin nor oath required. For personal study only.

✦ Synopsis

The zero range limit of one dimensional Schrodinger operator is studied by scaling technique and new results are obtained for potentials V with V(z)dz = 0.

R

Eine Bemerkung uber die Punktwechselwirkung in einer Dimension

I n h a l tsiibersicht. Wir untersuchen Punktwechselwirkung als Grenzwert eindimonsionnler Schrodinger-Operatoren mittels ScdingMethoden und erhalten neue Resultnte fiir Potentiale V mit J ~(z)dz = 0.

📜 SIMILAR VOLUMES

Symmetry, Duality, and Anholonomy of Poi
Symmetry, Duality, and Anholonomy of Point Interactions in One Dimension
✍ Taksu Cheon; Tamás Fülöp; Izumi Tsutsui 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 212 KB

We analyze the spectral structure of a one-dimensional quantum mechanical system with point interaction, which is known to be parametrized by the group U (2). Based on the classification of the interactions in terms of symmetries, we show, on a general basis, how the fermion-boson duality and the sp

Remarks on the regularity of biharmonic
Remarks on the regularity of biharmonic maps in four dimensions
✍ Roger Moser 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract We study intrinsic biharmonic maps on a four‐dimensional domain into a smooth, compact Riemannian manifold. We prove a partial regularity result without the assumption that the second derivatives are square‐integrable. © 2005 Wiley Periodicals, Inc.

Efficiently Approximating the Minimum-Vo
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of