Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.04281

On Scalar Products in Higher Rank Quantum Separation of Variables

J. M. Maillet·G. Niccoli·L. Vignoli
View original source ↗Read source document ↗Export metadata ↓

Abstract

Using the framework of the quantum separation of variables (SoV) for higher rank quantum integrable lattice models [1], we introduce some foundations to go beyond the obtained complete transfer matrix spectrum description, and open the way to the computation of matrix elements of local operators. This first amounts to obtain simple expressions for scalar products of the so-called separate states (transfer matrix eigenstates or some simple generalization of them). In the higher rank case, left and right SoV bases are expected to be pseudo-orthogonal, that is for a given SoV co-vector, there could be more than one non-vanishing overlap with the vectors of the chosen right SoV basis. For simplicity, we describe our method to get these pseudo-orthogonality overlaps in the fundamental representations of the $\mathcal{Y}(gl_3)$ lattice model with $N$ sites, a case of rank 2. The non-zero couplings between the co-vector and vector SoV bases are exactly characterized. While the corresponding SoV-measure stays reasonably simple and of possible practical use, we address the problem of constructing left and right SoV bases which do satisfy standard orthogonality. In our approach, the SoV bases are constructed by using families of conserved charges. This gives us a large freedom in the SoV bases construction, and allows us to look for the choice of a family of conserved charges which leads to orthogonal co-vector/vector SoV bases. We first define such a choice in the case of twist matrices having simple spectrum and zero determinant. Then, we generalize the associated family of conserved charges and orthogonal SoV bases to generic simple spectrum and invertible twist matrices. Under this choice of conserved charges, and of the associated orthogonal SoV bases, the scalar products of separate states simplify considerably and take a form similar to the $\mathcal{Y}(gl_2)$ rank one case.

Explore related subjects

math-phhep-thmath.MPnlin.SI

Keep this discovery

BibTeXRIS

J. M. Maillet, G. Niccoli, L. Vignoli. 2020-03-09. On Scalar Products in Higher Rank Quantum Separation of Variables. https://doi.org/10.21468/scipostphys.9.6.086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗