States with v 1 = λ , v 2 = − λ and reciprocal equations in the six - vertex model
نویسنده
چکیده
States with v 1 = λ, v 2 = −λ and reciprocal equations in the six-vertex model Abstract The eigenvalues of the transfer matrix in a six-vertex model (with periodic boundary conditions) can be written in terms of n constants v 1 ,. .. , v n , the zeros of the function Q(v). A peculiar class of eigenvalues are those in which two of the constants v 1 , v 2 are equal to λ, −λ , with ∆ = − cosh λ and ∆ related to the Boltzmann weights of the six-vertex model by the usual combination ∆ = (a 2 + b 2 − c 2)/2ab. The eigenvectors associated to these eigenvalues are Bethe states (although they seem not). We count the number of such states (eigenvectors) for n = 2, 3, 4, 5 when N , the columns in a row of a square lattice , is arbitrary. The number obtained is independent of the value of ∆ , but depends on N. We give the explicit expression of the eigenvalues in terms of a, b, c (when possible) or in terms of the roots of a certain reciprocal polynomial , being very simple to reproduce numerically these special eigenvalues for arbitrary N in the blocks n considered. For real a, b, c such eigenvalues are real. 1 The problem Some time ago the author of this note read in the paper Completeness of the Bethe Ansatz for the Six and Eight-Vertex Models by R.J Baxter [1, Sect. 4] the following sentence concerning certain proper states of the transfer matrix in the six-vertex model at zero-field:
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملG-designs, G-packings and G-coverings of λKv with a bipartite graph G of six vertices
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, is denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD). In this paper, we determine the existence spectrum for the G-designs of λKv, λ > 1, and construct the maximum packings and the minimum coverings o...
متن کاملO ct 2 00 8 ISING VECTORS IN THE VERTEX OPERATOR ALGEBRA V + Λ ASSOCIATED WITH THE LEECH LATTICE Λ
In this article, we study the Ising vectors in the vertex operator algebra V + Λ associated with the Leech lattice Λ. The main result is a characterization of the Ising vectors in V + Λ . We show that for any Ising vector e in V + Λ , there is a sublattice E ∼= √ 2E8 of Λ such that e ∈ V + E . Some properties about their corresponding τ -involutions in the moonshine vertex operator algebra V ♮ ...
متن کاملThe Centrally Symmetric V -states for Active Scalar Equations. Two-dimensional Euler with Cut-off
We consider the family of active scalar equations on the plane and study the dynamics of two centrally symmetric patches. We focus on the two-dimensional Euler equation written in the vorticity form and consider its truncated version. For this model, a non-linear and non-local evolution equation is studied and a family of stationary solutions {y(x, λ)}, x ∈ [−1, 1], λ ∈ (0, λ0) is found. For th...
متن کاملSufficient conditions for maximally edge-connected graphs and arc-connected digraphs
A connected graph with edge connectivity λ and minimum degree δ is called maximally edge-connected if λ = δ. A strongly connected digraph with arc connectivity λ and minimum degree δ is called maximally arc-connected if λ = δ. In this paper, some new sufficient conditions are presented for maximally edge-connected graphs and arc-connected digraphs. We only consider finite graphs (digraphs) with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005