Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1207.1928

Antiperiodic dynamical 6-vertex model I: Complete spectrum by SOV, matrix elements of the identity on separate states and connections to the periodic 8-vertex model

G. Niccoli
View original source ↗Read source document ↗Export metadata ↓

Abstract

The spin-1/2 highest weight representations of the dynamical 6-vertex and the standard 8-vertex Yang-Baxter algebra on a finite chain are considered in this paper. For the antiperiodic dynamical 6-vertex transfer matrix defined on chains with an odd number of sites, we adapt the Sklyanin's quantum separation of variable (SOV) method and explicitly construct SOV representations from the original space of representations. We provide the complete characterization of eigenvalues and eigenstates proving also the simplicity of its spectrum. Moreover, we characterize the matrix elements of the identity on separated states by determinant formulae. The matrices entering in these determinants have elements given by sums over the SOV spectrum of the product of the coefficients of separate states. This SOV analysis is not reduced to the case of the elliptic roots of unit and the results here derived define the required setup to extend to the dynamical 6-vertex model the approach recently developed in [1]-[5] to compute the form factors of the local operators in the SOV framework, these results will be presented in a future publication. For the periodic 8-vertex transfer matrix, we prove that its eigenvalues have to satisfy a fixed system of equations. In the case of a chain with an odd number of sites, this system of equations is the same entering in the SOV characterization of the antiperiodic dynamical 6-vertex transfer matrix spectrum. This implies that the set of the periodic 8-vertex eigenvalues is contained in the set of the antiperiodic dynamical 6-vertex eigenvalues. A criterion is introduced to find simultaneous eigenvalues of these two transfer matrices and associate to any of such eigenvalues one nonzero eigenstate of the periodic 8-vertex transfer matrix by using the SOV results. Moreover, a preliminary discussion on the degeneracy of the periodic 8-vertex spectrum is also presented.

Explore related subjects

math-phcond-mat.stat-mechhep-thmath.MP

Keep this discovery

BibTeXRIS

G. Niccoli. 2012-07-09. Antiperiodic dynamical 6-vertex model I: Complete spectrum by SOV, matrix elements of the identity on separate states and connections to the periodic 8-vertex model. https://doi.org/10.1088/1751-8113/46/7/075003

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↗