✦ LIBER ✦

Resonant branch cuts in a generalized Friedrichs model

✍ Scribed by G. E. Rudin; M. Gadella

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 662 KB
Volume: 58
Category: Article
ISSN: 0020-7608
DOI: 10.1002/(sici)1097-461x(1996)58:5<441::aid-qua2>3.0.co;2-y

No coin nor oath required. For personal study only.

✦ Synopsis

We study an example of a generalized Friedrichs model, in which a continuous-continuous coupling produces a pair of resonances as branch cuts of the analytic continuation of the reduced resolvent of the perturbed Hamiltonian to the second sheet of the Riemann surface associated to a transformation of the type w = z + a h . To define the perturbation, we use the theory of self-adjoint extensions of symmetric operators proposed by the group of St. Petersburg.

📜 SIMILAR VOLUMES

Generic cuts in models of arithmetic

✍ Richard Kaye 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator __Y__. The notion of “indicator” is de.ned in a novel way, without initially specifying what property is indicated and is used to de.ne a topologi

A branch-and-cut algorithm for solving g

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

✍ Suhl, Uwe H.; Hilbert, Heinrich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p

A branch & cut algorithm for the windy g

A branch & cut algorithm for the windy general routing problem and special cases

✍ Angel Corberán; Isaac Plana; José M. Sanchis 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real‐life applications. The Branch & Cut method presented here is based on a cutting‐plane algorithm that identi

Pattern Formation in a Generalized Chemo

Pattern Formation in a Generalized Chemotactic Model

✍ M.R. Myerscough; P.K. Maini; K.J. Painter 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 422 KB

Many models have been proposed for spatial pattern formation in embryology and analyzed for the standard case of zero-flux boundary conditions. However, relatively little attention has been paid to the role of boundary conditions on the form of the final pattern. Here we investigate numerically, the

A branch and cut algorithm for the Stein

A branch and cut algorithm for the Steiner problem in graphs

✍ Lucena, A.; Beasley, J. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

Model of a relativistic oscillator in a

Model of a relativistic oscillator in a generalized Schrödinger picture

✍ R.A. Frick 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB