Bound state transfer matrix for AdS5× S5superstring
نویسندگان
چکیده
منابع مشابه
The Bethe Ansatz for AdS5 × S Bound States
We reformulate the nested coordinate Bethe ansatz in terms of coproducts of Yangian symmetry generators. This allows us to derive the nested Bethe equations for the bound state string S-matrices. We find that they coincide with the Bethe equations obtained from a fusion procedure. The bound state number dependence in the Bethe equations appears through the parameters x± and the dressing phase o...
متن کاملA Matrix Lower Bound
A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a ful...
متن کاملK-Matrix Formalism for Three-Body Scattering and Bound-State Scattering
In this paper we introduce K matrix for three-body scattering and develop the K-matrix formalism corresponding to Faddeev's T-matrix formalism.l) In a previous paper ) (which is referred to, hereinafter, as A), brief but extensive explanations have been given for Faddeev's T-matrix formalism. The K-matrix formalism will be described in parallel with it. The symbols in A are also used here witho...
متن کاملLearning Bound for Parameter Transfer Learning
We consider a transfer-learning problem by using the parameter transfer approach, where a suitable parameter of feature mapping is learned through one task and applied to another objective task. Then, we introduce the notion of the local stability of parametric feature mapping and parameter transfer learnability, and thereby derive a learning bound for parameter transfer algorithms. As an appli...
متن کاملA Computable Error Bound for Matrix Functionals
Many problems in applied mathematics require the evaluation of matrix functionals of the form F(A) := u T f(A)u, where A is a large symmetric matrix and u is a vector. Golub and collaborators have described how approximations of such functionals can be computed inexpensively by using the Lanczos algorithm. The present note shows that error bounds for these approximations can be computed essenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2009
ISSN: 1029-8479
DOI: 10.1088/1126-6708/2009/10/025