CORRELATION FUNCTIONS OF INTEGRABLE MODELS, COMBINATORICS, AND RANDOM WALKS.
|
|
- Albert Stanley
- 5 years ago
- Views:
Transcription
1 CORRELATION FUNCTIONS OF INTEGRABLE MODELS, COMBINATORICS, AND RANDOM WALKS. Cyril Malyshev (in collaboration with Nikolay M. Bogoliubov) Steklov Mathematical Institute, RAS St.-Petersbug, RUSSIA RAQIS'16 Recent Advances in Quantum Integrable Systems Geneva, August 2016
2 ABSTRACT Certain quantum integrable models solvable by the Quantum Inverse Scattering Method demonstrate a relationship with combinatorics, partition theory, and random walks. Special thermal correlation functions of the models in question are related with the generating functions for plane partitions and self-avoiding lattice paths. The correlation functions of the integrable models admit interpretation in terms of nests of the lattice paths made by random walkers.
3 ********************************** TABLE OF CONTENT I. COMBINATORIAL PRELIMINARIES II.1 FREE FERMION LIMIT OF XXZ HEISENBERG MODEL II.2 CORRELATION FUNCTIONS AND VICIOUS WALKERS II.3 RANDOM WALKS AS THE CORRELATION FUNCTIONS III.1 WALKS ON SIMPLICIAL LATTICES III.2 GENERALIZED PHASE MODEL AND ITS SOLUTION III.3 TOTALLY ASYMMETRIC ZERO RANGE MODEL IV. CONCLUDING REMARKS
4 THE TALK IS BASED ON THE PAPERS [7] N. Bogoliubov, C. Malyshev, The correlation functions of strongly correlated bosons and random walks over simplicial lattices, PDMI preprint 4/2016. [6] N. Bogoliubov, C. Malyshev, Integrable models and combinatorics, Russian Math. Surveys 70 (2015), 789. [5] N. M. Bogoliubov, C. L. Malyshev, Correlation functions of XX0 Heisenberg chain, q-binomial determinants, and random walks, Nucl. Phys. B, 879 (2014), [4] N. Bogoliubov, Calculation of correlation functions in totally asymmetric exactly solvable models on a ring, Theoretical and Mathematical Physics 175 (2013), 755. [3] N. M. Bogoliubov, C. Malyshev, The correlation functions of the XXZ Heisenberg chain in the case of zero or innite anisotropy, and random walks of vicious walkers, St.-Petersburg Math. J. 22 (2011), [2] N. M. Bogoliubov, C. Malyshev, The correlation functions of the XX Heisenberg magnet and random walks of vicious walkers, Theor. Math. Phys., 159 (2009), No. 2, [1] N. M. Bogoliubov, T. Nassar, On the spectrum of the non-hermitian phase-dierence model, Phys. Lett. A, 234 (1997),
5 I. COMBINATORIAL PRELIMINARIES: q-binomial DETERMINANTS AND GENERATING FUNCTIONS OF PLANE PARTITIONS Let us begin with the denitions of the generating functions of boxed plane partitions and self-avoiding lattice walks. An array (π i,j ) i,j 1 of non-negative integers that are non-increasing as functions of both i and j (i, j = 1, 2,... ) is called boxed plane partition π. Plane partition is represented by cubes arranged as stacks with coordinates (i, j) and with height equal to π i,j. The plane partition is contained inside a box B(L, N, M) provided that i L, j N and π i,j M for all cubes of the plane partition.
6 The generating function of plane partitions inside B(L, N, P ) is dened as formal series Z q (L, N, P ) {π} q π (summation over all partitions inside the box), and it takes the form: Z q (L, N, P ) = L N P j=1 k=1 i=1 1 q i+j+k 1 L 1 q i+j+k 2 = N j=1 k=1 1 q P +j+k 1 1 q j+k 1. The limit q 1 leads to the MacMahon formula: A(L, N, P ) = L N P j=1 k=1 i=1 i + j + k 1 i + j + k 2 = L N j=1 k=1 P + j + k 1 j + k 1.
7 To calculate the correlation functions, we need the determinant of a block-matrix ( T) 1 j,k N given by entries: T kj = 1 q(p +1)(j+k 1) 1 q j+k 1, 1 k L, 1 j N, T kj = q j(n k), L + 1 k N, 1 j N, where P and L N are arbitrary. The matrix ( T) 1 j,k N consists of two blocks of the sizes L N and (N L) N. Several denitions are in order.
8 The q-binomial determinant ( a b) q ( ) a is dened by b q ( ) a1, a 2,... a S b 1, b 2,... b S q ([ ]) aj det, b i 1 i,j S where a and b are ordered tuples: 0 [ a] 1 < a 2 < < a S and aj 0 b 1 < b 2 < < b S. The entries are the q-binomial coecients: [ N r ] (1 qn )(1 q N 1 )... (1 q N r+1 ) (1 q)(1 q 2 )... (1 q r ) b i, q R. The q-binomial ( ) coecients are replaced at q 1 by the binomial aj coecients. The q-binomial determinant is transformed to the b i binomial determinant: ( a b) ( ) a1, a 2,... a S = det b 1, b 2,... b S The binomial determinant is positive at b i a i, i. (( aj b i )) 1 i,j S.
9 Ðèñ.: S-Tuple (w 1, w 2,..., w S) of self-avoiding walks for S = 5. Binomial determinant gives the number of self-avoiding walks across two-dimensional lattice. Each path w i from a tuple (w 1, w 2,..., w S ) goes from A i = (0, a i ) to B i = (b i, b i ), 1 i S. Only steps to north and to east are allowed.
10 So, let us consider ( T) 1 j,k N given by the entries: +1)(j+k 1) 1 q(p T kj = 1 q j+k 1, 1 k L, 1 j N, T kj = q j(n k), L + 1 k N, 1 j N, where P and L N are arbitrary. Now we formulate the following PROPOSITION 1 Let the matrix ( T) 1 j,k N, be dened by the entries (32) with P 2 < N < P. The determinant of ( T) 1 j,k N is given as: q L 2 (L 1)(N L) det( T) 1 j,k N V(q N )V(q L /q) = q N 2 (P 1)P ( L + N, L + N + 1,... L + N + P 1 L, L + 1,... L + P 1 = P L k=1 j=1 1 q j+k+n 1 1 q j+k 1 = Z q (L, N, P), where P P N + 1, and Z q (L, N, P) is the generating function of plane partitions. ) q
11 The PROPOSITION 1 relates det T to the q-binomial determinant, which is transformed at q 1 to the binomial determinant equal, in turn, to the number of P-tuples of lattice self-avoiding paths between the end points A l = (0, N + L + l 1) and B l = (L + l 1, L + l 1), 1 l P. The Figure gives appropriate picture with end points A l and B l at P = L = 3 and N = 2.
12 The generating function Z q (L, N, P) gives at q 1 the number of plane partitions A(L, N, P) inside B(L, N, P) : Z q (L, N, P) = L j=1 k=1 A(L, N, P) = det q 1 N 1 q P+j+k 1 1 q j+k 1 q 1 (( N + L + i 1 L + j 1 )) 1 i,j P RHS expresses the fact that number of plane partitions A(L, N, P) is equal to the number of self-avoiding lattice paths. Just the paths constituting a P-tuple are in bi-jection with, so-called, gradient lines corresponding to a plane partition inside B(L, N, P)..
13 I.1 FREE FERMION LIMIT OF XXZ HEISENBERG MODEL Consider XX0 model describing free-fermion limit of XXZ spin- 1 2 Heisenberg chain. The XX0 Hamiltonian in absence of magnetic eld takes the form: Ĥ XX 1 2 M (σ k+1 σ+ k + σ+ k+1 σ k ) = 1 2 k=0 M n,m=0 nm σ n σ + m, where nm is the hopping matrix with the entries nm = δ n m,1 + δ n m,m, or, less formally, =
14 The local spin operators σ ± k = 1 2 (σx k ± iσy k ), k {0, 1,..., M} are dened on sites of periodic chain of length M + 1, and they are the tensor products: σ # k = σ0 σ 0 }{{} σ # σ 0 σ 0, k where σ 0 is 2 2 unit matrix, and σ # at k th site is a Pauli matrix, σ # su(2) (# is either x, y, z or ±). The commutation rules are: [ σ + k, σ l ] = δ k,l σ z l, [ σ z k, σ ± l ] = ±2 δ k,l σ ± l.
15 ( 1 ) We introduce spin up and spin down states, 0 ( ) 0. The Pauli operators act on and as follows: 1 and σ =, σ = 0, σ = σ + = 0, σ + =, σ + = ( ) 00, 10 ( ) The lattice spin operators dened above act over the the state-vectors M k=0 s k, where s =,. The state-vectors are elements of the state-space H M+1 = M ( ) C 2 k. k=0 The periodic boundary conditions σ # k+(m+1) = σ# k are imposed. **********************************
16 Let the sites with spin down states are labeled by decreasing coordinates M µ 1 > µ 2 >... > µ N 0, which constitute strict partition µ = (µ 1, µ 2,..., µ N ). In the free-fermion limit, we dene N-excitation state-vectors Ψ N (u) : Ψ N (u) = λ {M N } ( N ) S λ (u 2 ) σµ k, k=1 M n, n=0 where λ = (λ 1, λ 2,..., λ N ) is λ = µ δ N, where δ N = (N 1, N 2,..., 1, 0). Besides, M M + 1 N λ 1 λ 2 λ N 0. The parameters u = (u 1, u 2,..., u N ) and u 2 (u 2 1, u 2 2,..., u 2 N ) correspond to arbitrary complex numbers.
17 The coecients of the state-vector Ψ N (u) are given by the Schur functions dened by the Jacobi-Trudi relation: S λ (x N ) S λ (x 1, x 2,..., x N ) det(xλ k+n k j ) 1 j,k N, V(x N ) in which V(x N ) is the Vandermonde determinant V(x N ) det(x N k j ) 1 j,k N = 1 m<l N (x l x m ).
18 There is a natural correspondence between the coordinates of the spin down states µ and the partition λ expressed by the Young diagram: µ4 µ3 µ2 µ λ3 λ2 λ4 λ1 Ðèñ.: Relation of the spin down coordinates µ = (8, 5, 3, 2) and partition λ = (5, 3, 2, 2) for M = 8, N = 4.
19 The states Ψ N (u) are the eigen-states, Ĥ XX Ψ N (u N ) = E N Ψ N (u N ), with eigen-values E N EN XX(I 1, I 2,..., I N ) = ( ) N l=1 cos 2πIl M+1, if and only if u l (1 l N) satisfy the Bethe equations: u 2(M+1) j = ( 1) N 1, u 2 j = e i 2π M+1 Ij, 1 j N. where I j are integers or half-integers: M I 1 > I 2 > > I N 0.
20 The scalar products of the state-vectors are calculated by means of the BinetCauchy formula: = P L/n (y, x) yl nxn l l=1 1 k<j N λ {(L/n) N } S λ (x 2 1,..., x 2 N)S λ (y 2 1,..., y 2 N ) ( N ) det(t jk ) 1 j,k N ( y 2 j yk) 2 1 m<l N (x2 l x2 m), where summation λ {(L/n) N } is over non-strict partitions λ: L λ 1 λ 2 λ N n, n 0. The entries T jk take the form: T kj = 1 (x ky j ) N+L n 1 x k y j. **********************************
21 PROPOSITION 2 The following sums of products of the Schur functions take place: λ {M N n } λ {M N n } 2 Sˆλ(v N )S λ(u 2 N n) = S λ (v 2 N n )Sˆλ(u 2 N ) = ( N n l=1 ( N n l=1 u 2n l v 2n l ) ) det( T kj ) 1 k,j N V(u 2 N n )V(v 2 N ), det( T kj ) 1 k,j N V(v 2 N n )V(u2 N ),
22 where the entries of the matrices ( T kj ) 1 k,j N and ( T kj ) 1 k,j N are: T kj = T o kj, 1 k N n, 1 j N, and T kj = v 2(N k) j, N n + 1 k N, 1 j N, T kj = T o kj, 1 k N, 1 j N n, T kj = u 2(N k) j, 1 k N, N n + 1 j N.
23 I.2 CORRELATION FUNCTIONS AND VICIOUS WALKERS Consider the simplest one-particle correlation function G (j, l t) σ + j e th σ l, where H is the Hamiltonian. Dierentiating G (j, l t) over t and using the commutators obtain: d dt G (j, l t) = n The correlation function satises: nl σ + j e th σ n = n d G (j, l t) = G (j, l 1 t) + G (j, l + 1 t), dt nl G (j, n t). for xed j (and analogous eqn at xed l). The initial condition is: G (j, l 0) = δ jl.
24 The correlator G (j, l t) may be considered as the generating function of random walks. Expanding in powers of t one has: G (j, l t) = K=0 t K K! σ+ j ( H)K σ l. This equality may be interpreted as follows. Position of the walker on lattice is labelled by the spin down state, while the spin up states correspond to empty sites. The relation enables to enumerate all admissible trajectories of the walker starting from l th site. The state σ + j acting on from the left allows to x the ending point of the trajectories because of orthogonality of the spin states. Hence, σ + j ( H)K σ l = ( K) jl, i.e., we obtain the entry of K th power of the hopping matrix { nl } 0 n,l M.
25 Consider an innite chain (M ). In this case the solution respecting G(j, l 0) = δ j, l is the modied Bessel function I j l (t): G(j, l t) = I j l (t) = 1 2π π π e t cos θ e i(j l)θ dθ. Let K be such that K l j and K + j l = 0(mod 2). Then dierentiation gives the binomial formula P K (l j) = CK L for the number of all lattice paths of length K between two sites on an innite axis: ( d ) K[G(j, ] (m + 2L)! P K (l j) l t) t=0 = dt L! (m + L)!, where L (K m)/2 is half the number of turns.
26 Consider now the multi-particle correlation function ( N ) ( N ) G(j; l t) = σ + j n e th σ l k, n=1 k=1 which is parametrized by multi-indices j (j 1, j 2,..., j N ) and l (l 1, l 2,..., l N ). This correlator is the generation function of N random turns vicious walkers. The average ( N ) ( N σ + j n ( H) K n=1 k=1 ) σ l k is equal to the number of nests of trajectories of N random turns walkers being initially located on the sites l 1 > l 2 > > l N and arrived at the positions at j 1 > j 2 > > j N after K steps. The condition that vicious walkers do not touch each other up to N steps is guaranteed by the Pauli matrices (σ ± k )2 = 0.
27 Dierentiating by t and using commutators one obtains: d N dt G(j; l t) = ( G(j; l1, l 2,..., l k + 1,..., l N t) k=1 + G(j; l 1, l 2,..., l k 1,..., l N t) ) (j is xed). The non-intersection condition means that G(j; l t) = 0 if l k = l p (or j k = j p ) for any 1 k, p N. The solution is represented in the determinantal form: G(j; l t) = det ( G(j r, l s t) ) 1 r,s N, where G(j, l t) is the one-particle correlator. The initial condition is: G(j; l 0) = N m=1 δ j m,l m.
28 Let P K (l j) is the number of K-step trajectories traced by N vicious walkers in the random turns model. A typical conguration of paths for three walkers is shown in gure: K Ðèñ.: A conguration of paths of three vicious walkers (l = (2, 5, 7), j = (4, 5, 6)) in the random turns model.
29 The generating function G(j; l t) may be expressed in the form: G(j; l t) = 1 (M + 1) N {φ N } e βe N (φ N ) V N (e iφ N ) 2 S λ L(e iφ N )Sλ R(e iφ N ), ( ) where the parametrization φ km = 2π M+1 km M 2, 1 m N, is used. Summation is over N-tuples φ N (φ k1, φ k2,..., φ kn ), parametrized by integers k i, 1 i N, respecting M k 1 > k 2 > k N 0. Here E N (φ N ) is the energy.
30 I.3 RANDOM WALKS AS THE CORRELATION FUNCTIONS The thermal correlation function can be considered which is related to the projection operator Π n that forbids spin down states on the rst n sites of the chain and we shall call it the persistence of ferromagnetic string : T (θ g N, n, t) Ψ(θ g N ) Π n e thxx Π n Ψ(θ g N ) n 1 Ψ(θ g N ) e thxx Ψ(θ g N ), Πn j=0 I + σ z j 2 where t C. The correlator is calculated on the ground state solution of the Bethe equation. We shall consider the nominator separately under arbitrary parametrization:, Ψ N (v) Π n e βĥxx Πn Ψ N (u) = S λ L(v 2 )S λ R(u 2 )G µl ; µ R(β). λ L, λ R {(M N n) N }
31 To give the combinatorial interpretation, we need a relationship between Schur functions and lattice paths. A combinatorial description of the Schur functions may be given in terms of semistandard Young tableaux. A lling of the cells of the Young diagram of λ with positive integers n N + is called a semistandard tableau of shape λ provided it is weakly increasing along rows and strictly increasing along columns. A denition of the Schur function is given: S λ (x 1, x 2,..., x m ) = T x T, x T i,j x Tij, where m N, the product is over all entries T ij of the tableau T, and the sum is over all tableaux T of shape λ with the entries being numbers {1, 2,..., m}. Each semistandard tableau of shape λ with entries not exceeding N is a nest of self-avoiding lattice paths with xed start and end points. Let T ij be an entry in i th row and j th column of the semistandard tableau T. The i th lattice path of the nest C (counted from the top of the nest) encodes the i th row of the tableau (i = 1,..., N). It goes from C i = (N i + 1, N i) to (1, µ i = λ i + N i). It makes λ i steps to the north so that
32 the step along the line x j corresponds to the occurrences of the letter N j + 1 in the i th row of T. The power l j of x j in the weight of any particular nest of paths is the number of steps to north taken along the vertical line x j. Thus, the Schur function takes the form: S λ (x 1, x 2,..., x N ) = C where summation is over all admissible nests C µ1 µ2 N j=1 x lj j, С1 С2 С3 С4 µ3 µ С5 С6 µ5 x6 x5 x4 x3 x2 x1 Ðèñ.: A nest of lattice paths C, corresponding to semistandard tableau with weight x 3 6x 2 5x 2 4x 4 3x 3 2x 3 1 on the diagram λ = (5, 5, 3, 2, 2, 0) for N = 6.
33 The scalar product, being the product of two Schur functions, may be graphically expressed as a nest of the equidistant points (1 i N ). Ci N self-avoiding lattice paths starting at and terminating at the equidistant points This con guration, known as watermelon. The scalar Bi product is given by the sum of all such watermelons. Rotating Fig. by counter-clockwise we see that the watermelon is a particular case of con guration for lock step random walkers. π 4
34 The partition function of watermelons is equal to the q-parameterized (In the q-parametrization v 2 = q (q, q 2,..., q N ), u 2 = q/q = (1, q,..., q N 1 )) scalar product: Ψ N (q 1 2 ) ΨN ((q/q) 1 2 ) = λ {M N } S λ (q)s λ (q/q) = {W} q ξ C+ ζ B = Z(N, N, M), where the sum is taken over all watermelons with the xed endpoints C i, B i, 1 i N.
35 Further, we obtain the following transition amplitude: Ψ N (v N ) Π n e th Πn Ψ N (u) = G(λ L + δ N ; λ R + δ N t)s λ L(v 2 ) S λ R(u 2 ) λ L, λ R {(M N n) N } = K=0 t K K! λ L,R \n {(M n) N } ( N l=1 σ + µ L l S λ L(v 2 ) S λ R(u 2 ) ) ( H) K ( N p=1 σ µ R p ). Here u and v stand for an arbitrary parametrization. The elements of the expansion in right-hand side may be interpreted in terms of nests of self-avoiding lattice paths as follows. For the rst N steps the particles are moving to the west (from the right to the left) according the lock step rules. They are doing next K steps according to the random turns rules. The nal N steps to the west are again according the lock step rules.
36 The example of the described nest of lattice paths is schematically depicted in Figure. 9 8 K B1 B2 B3 B4 С1 С2 1 0 С3 С4 L R Ðèñ.: One of the nest of lattice paths that corresponds to the amplitude Ψ(vN ) Π 0 ( H) K Π0 Ψ(uN )
37 II.1 WALKS ON SIMPLICIAL LATTICES Starting from (M + 1)-dimensional hypercubical lattice with unit spacing Z M+1 m (m 0, m 1,..., m M ), let us consider a set of points with coordinates constrained by the requirement m 0 + m m M = N: Symp (N) (Z M+1 ) { m Z M+1 0 mi, i M, m i = N } i M (hereafter M {0, 1,... M}). We call Symp (N) (Z M+1 ) simplicial lattice. Random walks of a walker over sites of Symp (N) (Z M+1 ) are dened by a set of admissible steps Ω M such that at each step an i th coordinate m i increases by unity while a nearest neighboring coordinate decreases by unity. Namely, Ω M is the set of steps with coordinates (e 0, e 2,..., e M ) such that for all pairs (i, i + 1) with 0 i M and M + 1 = 0( mod 2), e i = ±1, e i+1 = 1 and e j = 0 for all j M and j i, i + 1. The step-set Ω M Ω M (m 0 ) ensures that trajectory of a random walk determined by the starting point m 0 lies in M-dimensional set Symp (N) (Z M+1 ).
38 N N 0 N Ðèñ.: The hopping processes for the one-dimensional nearest-neighbor random walk on a segment [0,N]. As an example, the walks on Z 2 are dened by a step-set Ω 1 = {(1, 1), ( 1, 1)} that ensures that the walks lie on lines { (n0, n 1 ) Z 2 n 0 + n 1 = N }.
39 The step-set Ω 2 = {( 1, 1, 0), (1, 1, 0), (0, 1, 1), (0, 1, 1), (1, 0, 1), ( 1, 0, 1)} of the random walks, or Ω 2 = {( 1, 1, 0), (0, 1, 1), (1, 0, 1)} of the directed walks, ensures that trajectories of random walks belong to Symp (N) (Z 3 ). N 2 0 N 0 N 1 Ðèñ.: A two-dimensional triangular simplicial lattice.
40 Directed random walks on M-dimensional orientated simplicial lattice are dened by a step-set Γ M = (k 0, k 1,..., k M ) such that for all pairs (i, i + 1) with i M and M + 1 = 0( mod 2), k i = 1, k i+1 = 1, and k j = 0 for all j M\{i, i + 1}. Ðèñ.: The orientated two-dimensional bounded simplicial lattice dened by the step-set Γ 2. The walks are allowed only in the direction of arrows.
41 The walker's movements should be supplied with appropriate boundary conditions. The reecting boundary conditions imply that when trajectory and boundary are intersecting, the corresponding admissible steps are still taken from Ω M or Γ M. The retaining boundary conditions imply that the walker on the boundary continues to move in accordance with the elements of Ω M or Γ M either stays on the boundary. The boundary of the simplicial lattice consists of M + 1 faces of highest dimensionality M 1. To each component of the boundary a weight g s, s = 0, 1,..., M, is assigned.
42 Consider the retaining boundary conditions. The exponential generating function of lattice walks is dened as a series F (N) t k (l, j t) = k! G(N) k (l, j), k=0 where G (N) k (l, j) characterize the k-step walks at a node l = (l 0, l 1,..., l M ) Simp (N) (Z M+1 ) when starting at j = (j 0, j 1,..., j M ) Simp (N) (Z M+1 ). The master equation is: t F (N) (l, j t) = M F (N) (l, j 0, j 1,..., j s 1, j s+1 + 1,... j M ) s=0 M + F (N) (l, j 0, j 1,..., j s + 1, j s+1 1,... j M ) s=0 M + g s F (N) (l, j 0, j 1,..., j s 1, 0, j s+1,... j M ) δ(n, s=0 jk ), 0 k M where δ(n, m) is the Kronecker symbol, and implies that k = s is omitted. The equation for the directed walks is obtained by removing the second sum in right-hand side.
43 The system of equations for G (N) k (l, j): s=0 G (N) k (l, j) = M s=0 s=0 G (N) k 1 (l, j 0, j 1,..., j s 1, j s+1 + 1,... j M ) M + G (N) k 1 (l, j 0, j 1,..., j s + 1, j s+1 1,... j M ) M + g s G (N) k 1 (l, j 0, j 1,..., j s 1, 0, j s+1,... j M ) δ(n, jk ), 0 k M where k 1, while it is natural to impose the condition G (N) 0 (l, j) = δ l0j 0 δ l1j 1 δ lm j M.
44 II.2 GENERALIZED PHASE MODEL AND ITS SOLUTION Generalized Phase Model describes N bosonic particles on a cyclic chain of M + 1 nodes. Each conguration of the particles is characterized by a collection of the occupation numbers (n M,..., n 1, n 0 ), l M n l = N. The phase operators φ n, φ n respect the algebra [ ˆN i, φ j ] = φ i δ ij, [ ˆN i, φ j ] = φ i δ ij, [φ i, φ j ] = π iδ ij, where ˆN j is the number operator, and π i = 1 φ i φ i is the vacuum projector: φ j π j = π j φ j = 0. The Fock states n l l = (φ l )n l 0 l, where 0 l is the vacuum state 0 at l th site dened by φ l 0 = 0: φ l n l l = n l + 1 l, φ l n l l = n l 1 l, ˆNl n l l = n l n l l. The Fock states n are generated from 0 by the rising operators φ j : n l=0 where n Symp (N) (Z M+1 ). M ( M ( n l l = φ ) ) nj 0, 0 j=0 j M 0 l, l=0
45 The operators act on the state-vectors: φ j n 0,..., 0 j,..., n M = 0, φ j n 0,..., n j,..., n M = n 0,..., n j + 1,..., n M, φ j n 0,..., n j,..., n M = n 0,..., n j 1,..., n M, ˆN j n 0,..., n j,..., n M = n j n 0,..., n j,..., n M π j n 0,..., 0 j,..., n M = n 0,..., 0 j,..., n M. The states n 0,..., n M are orthogonal.
46 As generator of directed walks with the retaining boundary conditions we consider the non-hermitian Hamiltonian [N. M. Bogoliubov, T. Nassar, On the spectrum of the non-hermitian phase-dierence model, Phys. Lett. A 234, 345 (1997)]: H = M ( φm φ m+1 + g ) mπ m, m=0 where M + 1 is even and periodicity is imposed. The Hamiltonian commutes with the number operator ˆN. The exponential generating function of the directed walks is expressed as the correlation function: F (N) (l, j t) = l e th j, where H is the Hamiltonian. Expanding the correlator we obtain the coecients G (N) k (l, j) characterizing the lattice walks from the node j to the node l in k steps: G (N) k (l, j) = l H k j.
47 Dene L-operator which is 2 2 matrix with operator entries: ( ) u L(n u) 1 + ug n π n φ n, φ n u where u C is a parameter and g n R. The intertwining relation R(u, v) (L(n u) L(n v)) = (L(n v) L(n u)) R(u, v), in which R(u, v) is the R-matrix f(v, u) R(u, v) = 0 g(v, u) g(v, u) 0, f(v, u) where f(v, u) = u2 uv u 2, g(v, u) = v2 u 2 v 2, u, v C.
48 The monodromy matrix: ( ) A(u) B(u) T (u) = L(M u)l(m 1 u) L(0 u) =. C(u) D(u) The commutation relations of the matrix elements are given: R(u, v) (T (u) T (v)) = (T (v) T (u)) R(u, v). The transfer matrix τ(u) is: τ(u) = tr T (u) = A(u) + D(u). The relation means [τ(u), τ(v)] = 0, u, v C. The entries of T (u): u M+1 A(u) = 1 + u 2( M 1 m=0 φ m φ m+1 + M u M+1 D(u) = u 2 φ 0 φ M u 2(M+1), m=0 g m π m ) + u 2(M+1) M m=0 g m π m, u M B(u) = φ u2m P R B(u), u M C(u) = φ M u 2M P L C(u), where P R = M φ k g k+1π k+1... g M π M, P L = M g 0 π 0... g k 1 π k 1 φ k. k=0 k=0
49 The Hamiltonian is expressed: H = u 2 um+1 τ(u) = u=0 u 2 um+1 (A(u) + D(u)). u=0 The N-particle state-vectors are taken in the form ( N Ψ N (u) = j=1 ) B(u j ) 0, where u = (u 0, u 1,..., u N ), and B(u) is dened above. The vacuum 0 is an eigen-vector of A(u) and D(u), A(u) 0 = α(u) 0, D(u) 0 = δ(u) 0 with the eigen-values α(u) = M j=0 (u 1 + g j u), δ(u) = u M+1. The state-vector is the eigen-vectors both of H and τ(u), if and only if: u 2N n M j=0 ( gj + u 2 ) n = ( 1) N 1 N j=1 u 2 j.
50 From the eigen-value Θ N (v) of τ(v) obtain the spectrum: E N (u) = v 2 vm Θ N (v) M N v=0 = g m + u 2 m. m=0 m=1 For the model associated with the R-matrix the scalar product of the state-vectors is [N. Bogoliubov, Boxed plane partitions as an exactly solvable boson model, J. Phys. A: Math. Gen. 38, 9415 (2005)]: Ψ N (v) Ψ N (u) = V 1 N (v2 )V 1 N (u 2 ) N j=1 ( vj u j ) M+N 1 det Q, where V N (x) 1 i<k N (x k x i ), and Q jk, 1 j, k N are: Q jk = α(v j)δ(u k )(u k /v j ) N 1 α(u k )δ(v j )(u k /v j ) N+1 u k /v j v j /u k, with α(u) and δ(u) as above. The resolution of the identity operator I = {u} Ψ N (u) Ψ N (u) N 2, (u) where summation {u} is over all independent solutions of the Bethe
51 Let us consider the walker on Simp (N) (Z M+1 ). His starting point at the node (N, 0,..., 0), and the walk terminates at (0, 0,..., N). The generating function of the walks is: F (N) (t) 0, 0,..., N e th N, 0,..., 0 = 0 (φ M ) N e th (φ M )N 0. Inserting the identity operator obtain: F (N) (t) = {u} e te N (u) N 2 (u) 0 (φ M ) N Ψ N (u) Ψ N (u) (φ M )N 0, where the summation is over all independent solutions of Bethe equations. From B(u) and C(u) obtain: 0 (φ M ) N Ψ N (u) = lim v 0 Ψ N (v) Ψ N (u) = 1, Ψ N (u) (φ M )N 0 = lim v 0 Ψ N (u) Ψ N (v) = 1, [N. Bogoliubov, Calculation of correlation functions in totally asymmetric exactly solvable models on a ring, Theoretical and Mathematical Physics 175, 755 (2013)].
52 Eventually we obtain: F (N) (t) = {u} e 2t N k=1 (g k+u 2 k ) N 2 (u) For instance, at N = 2 and M = 1 we obtain for g k = γ = 1 k:. F (2) (t) = e 4tγ e2t(u 2 1 +u 2 2 ) {u 2 1,u2 2 } N 2 (u 2 1, u2 2 ), N 2 (u 2 1, u 2 2) = 4 + u2 1 u 2 + u2 2 2 u 2 + 4γ(u u 2 1) + 3γ 2 u 2 2u
53 II.3 TOTALLY ASYMMETRIC ZERO RANGE MODEL When all g i are equal to γ = 1, we obtain the Hamiltonian of Totally Asymmetric Zero Range Model: M ( H zr = φm φ m+1 + π ) m. m=0 The state-vector enables the representation in the form Ψ N (u) = λ {M N } ( M χ R λ(u) (φ j ) 0, )nj where the function χ R λ is equal, up to a multiplicative pre-factor, to { (1 χ R λ(x) = χ R λ(x 1, x 2,..., x N ) = V 1 N (x) det ) + x 2 λj } 2(N j) i x i. Here λ denotes the partition (λ 1,..., λ N ) of non-increasing non-negative integers, M λ 1 λ 2... λ N 0, and V N (x) is the Vandermonde determinant. j=0
54 There is a one-to-one correspondence between a sequence of the occupation numbers (n M,..., n 1, n 0 ), j M n j = N, and the partition λ = (M n M, (M 1) n M 1,..., 1 n1, 0 n0 ), where each number S appears n S times (see Fig. 4). The summation goes over all partitions λ into at most N parts with N M. 0 6 Ðèñ.: A conguration of particles (N = 4) on a lattice (M = 6), the corresponding partition λ = (6 1, 5 0, 4 0, 3 2, 2 0, 1 1, 0 0 ) (6, 3, 3, 1) and its Young diagram.
55 Acting by the Hamiltonian on the state-vector, we nd: N k=1 χ R λ 1,...,λ k +1,...,λ N (u) = E zr N (u)χ R λ 1,...,λ N (u), together with the exclusion condition χ R λ 1,...,λ l 1 =λ l +1,λ l,...,λ N (u) = χ R λ 1,...,λ l 1 =λ l,λ l,...,λ N (u), 1 l N. The energy E zr N is given with all g i = 1. The state-vector is the eigen-vector of the Hamiltonian with the periodic boundary conditions if the parameters u j satisfy the appropriate Bethe equations.
56 Expanding the left state-vector, we obtain: Ψ N (u) = V 1 N (x) Equations take place: λ {M N } N k=1 det { ( ) λj x i x i + x 1 x 2(N j) i i } ( M 0 i=0 ) φ ni i. χ L λ 1,...,λ k 1,...,λ N (u) = E zr N (u)χ L λ 1,...,λ N (u), χ L λ 1,...,λ l 1 =λ l 1,λ l,...,λ N (u) = χ L λ 1,...,λ l 1 =λ l,λ l,...,λ N (u), 1 l N. Further one obtains: l 0, l 1,..., l M Ψ N (u) = χ R λ R (u) Ψ N (u) j 0, j 1,..., j M = χ L λ L (u), where λ R = ( M l M, (M 1) l M 1,..., 1 l1, 0 l0 ), and λ L = ( M j M, (M 1) j M 1,..., 1 j1, 0 j0 ).
57 The exponential generating function in the considered special case is: F zr (N) (l, j t) = {u} e tezr N (u) N 2 zr(u) χr λ R (u)χ L λ L (u). Here parameters u j satisfy Bethe equations with g i = 1, and N 2 zr(u) is the squared norm in the same limit: N 2 (u) = Ψ N (u) Ψ N (u) = det Q V N (u 2 )V N (u 2 ).
58 II.4 THE PHASE MODEL We shall consider the random walks on Simp (N) (Z M+1 ) which are dened by a step-set Ω M. The Hermitian Hamiltonian H ph of the phase model is the generator of the walks : M ( H ph = φm φ m+1 + ) φ mφ m+1. The L-operator is m=0 and the Bethe equations are: The state-vectors are: ( ) u 1 φ L(n u) n, φ n u u 2(N+M+1) n Ψ N (u) = λ {M N } = ( 1) N 1 N j=1 u 2 j. ( M ) S λ (u 2 ) (φ l )n l 0, l=0
59 where S λ (u 2 ) is the Schur function. The non-strict partition λ is connected with the coordinates of the Bose particles, as it was explained above. On the solutions of the Bethe equations the state-vectors are the eigen-vectors of the Hamiltonian with the eigen-energies E ph N (u) = N k=1 ( u 2 k + u 2 ) k. The conjugate state vector is of the form: Ψ N (v) = S λ (v 2 ) 0 (φ M ) n M... (φ 1 ) n1 (φ 0 ) n0. λ {M N } For arbitrary u and v the scalar product of N-particle state vectors is given by the Cauchy-Binet formula: Ψ N (v) Ψ N (u) = λ {M N } S λ (v 2 )S λ (u 2 ) = det(t kj) 1 k,j N V N (u 2 )V N (v 2 ), T kj = 1 (u2 k /v2 j )M+N 1 (u 2 k /v2 j ).
60 In the q-parametrization v 2 = q (q, q 2,..., q N ), u 2 = q/q = (1, q,..., q N 1 ) the scalar product takes the form: det Ψ N (q 1 2 ) ΨN ((q/q) 1 2 ) = = N N k=1 j=1 ( 1 q (M+N)(j+k 1) 1 q (j+k 1) )1 j,k N V N (q)v N (q/q) 1 q M 1+j+k 1 q j+k 1 = Z q (N, N, M). As it follows from PROPOSITION, the sum of the Schur functions in q-parametrization may be expressed through the q-binomial determinant: ([ ]) S λ (q)s λ (q/q) = q NM 2 (1 M) 2N + i 1 det. N + j 1 λ M N 1 i,j M The entries are the q-binomial coecients dened as [ ] R [R]!, [n]! [1] [2]... [n], [0]! 1 r [r]! [R r]! where [n] is the q-number being q-analogue of a positive integer n Z +, [n] (1 q n )/(1 q).
61 The generating function Z q (L, N, P ) takes the form: Z q (L, N, P ) = L N P j=1 k=1 i=1 R.H.S. tends to A(L, N, P ) at q 1: A(L, N, P ) = L N P j=1 k=1 i=1 1 q i+j+k 1 L 1 q i+j+k 2 = i + j + k 1 i + j + k 2 = N j=1 k=1 L N j=1 k=1 1 q P +j+k 1 1 q j+k 1. P + j + k 1 j + k 1 i.e. there are A(L, N, P ) plane partitions in box B(L, N, P ) (the McMahon's formula). In other words we obtain that the scalar product Ψ N (q 1 2 ) Ψ N ((q/q) 1 2 ) for the phase model in question is equal to the generating function Z q (N, N, M) of plane partitions in the box B(N, N, M).,
62 The generating function of random walks on a Simp (N) (Z M+1 ) is similar to that of the Totally Asymmetric Zero Range Model: F (N) ph (l, j t) = {u} with the squared norm N 2 ph (u): N 2 ph(u) = e teph N (u) N 2 ph (u) S λ R (u 2 )S λl (u 2 ) λ {M N } S λ (u 2 )S λ (u 2 ).
63 III. CONCLUDING REMARKS We have presented an approach to the calculation of thermal correlation functions of quantum integrable models based on the theory of symmetric functions. We considered XX0 model and two modications of the phase model: the modication described by non-hermitian Hamiltonian and retaining boundary conditions and the modication described by Hermitian Hamiltonain and by reecting boundary conditions. The approach is based on representation of the state-vectors with the use of symmetric functions (apart from the symmetric functions for the phase model with retaining conditions, we should mention the Shur functions in the case of XXZ model for innite anisotropy, as well as for four-vertex model). Such notions of enumerative combinatorics as partitions, plane partitions, self-avoiding lattice paths (the limiting cases of the XXZ model) appear naturally in the investigation of form factors and in the study of the asymptotic behaviour of the correlation functions. The problem of computing the formfactors of operators in the special q-parametrization is reduced to the computation of q-binomial determinants which are the generating functions for plane partitions in a box of nite size.
64 Binomial determinants appear in the limit q 1, thus giving an interpretation of the resulting form factors in terms of self-avoiding lattice paths.
65 THANKS!
Combinatorial Interpretation of the Scalar Products of State Vectors of Integrable Models
Combinatorial Interpretation of the Scalar Products of State Vectors of Integrable Models arxiv:40.0449v [math-ph] 3 Feb 04 N. M. Bogoliubov, C. Malyshev St.-Petersburg Department of V. A. Steklov Mathematical
More informationIt is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a
Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the
More informationIntegrable structure of various melting crystal models
Integrable structure of various melting crystal models Kanehisa Takasaki, Kinki University Taipei, April 10 12, 2015 Contents 1. Ordinary melting crystal model 2. Modified melting crystal model 3. Orbifold
More informationCombinatorial bases for representations. of the Lie superalgebra gl m n
Combinatorial bases for representations of the Lie superalgebra gl m n Alexander Molev University of Sydney Gelfand Tsetlin bases for gln Gelfand Tsetlin bases for gl n Finite-dimensional irreducible representations
More informationA RELATION BETWEEN SCHUR P AND S. S. Leidwanger. Universite de Caen, CAEN. cedex FRANCE. March 24, 1997
A RELATION BETWEEN SCHUR P AND S FUNCTIONS S. Leidwanger Departement de Mathematiques, Universite de Caen, 0 CAEN cedex FRANCE March, 997 Abstract We dene a dierential operator of innite order which sends
More informationRefined Cauchy/Littlewood identities and partition functions of the six-vertex model
Refined Cauchy/Littlewood identities and partition functions of the six-vertex model LPTHE (UPMC Paris 6), CNRS (Collaboration with Dan Betea and Paul Zinn-Justin) 6 June, 4 Disclaimer: the word Baxterize
More informationGeneralization of the matrix product ansatz for integrable chains
arxiv:cond-mat/0608177v1 [cond-mat.str-el] 7 Aug 006 Generalization of the matrix product ansatz for integrable chains F. C. Alcaraz, M. J. Lazo Instituto de Física de São Carlos, Universidade de São Paulo,
More informationClassical Lie algebras and Yangians
Classical Lie algebras and Yangians Alexander Molev University of Sydney Advanced Summer School Integrable Systems and Quantum Symmetries Prague 2007 Lecture 1. Casimir elements for classical Lie algebras
More information(1.1) In particular, ψ( q 1, m 1 ; ; q N, m N ) 2 is the probability to find the first particle
Chapter 1 Identical particles 1.1 Distinguishable particles The Hilbert space of N has to be a subspace H = N n=1h n. Observables Ân of the n-th particle are self-adjoint operators of the form 1 1 1 1
More informationThe Quantum Heisenberg Ferromagnet
The Quantum Heisenberg Ferromagnet Soon after Schrödinger discovered the wave equation of quantum mechanics, Heisenberg and Dirac developed the first successful quantum theory of ferromagnetism W. Heisenberg,
More informationClassical and quantum aspects of ultradiscrete solitons. Atsuo Kuniba (Univ. Tokyo) 2 April 2009, Glasgow
Classical and quantum aspects of ultradiscrete solitons Atsuo Kuniba (Univ. Tokyo) 2 April 29, Glasgow Tau function of KP hierarchy ( N τ i (x) = i e H(x) exp j=1 ) c j ψ(p j )ψ (q j ) i (e H(x) = time
More informationExact diagonalization methods
Summer School on Computational Statistical Physics August 4-11, 2010, NCCU, Taipei, Taiwan Exact diagonalization methods Anders W. Sandvik, Boston University Representation of states in the computer bit
More informationb c a Permutations of Group elements are the basis of the regular representation of any Group. E C C C C E C E C E C C C E C C C E
Permutation Group S(N) and Young diagrams S(N) : order= N! huge representations but allows general analysis, with many applications. Example S()= C v In Cv reflections transpositions. E C C a b c a, b,
More informationStatistical Mechanics & Enumerative Geometry:
Statistical Mechanics & Enumerative Geometry: Christian Korff (ckorff@mathsglaacuk) University Research Fellow of the Royal Society Department of Mathematics, University of Glasgow joint work with C Stroppel
More informationThe AKLT Model. Lecture 5. Amanda Young. Mathematics, UC Davis. MAT290-25, CRN 30216, Winter 2011, 01/31/11
1 The AKLT Model Lecture 5 Amanda Young Mathematics, UC Davis MAT290-25, CRN 30216, Winter 2011, 01/31/11 This talk will follow pg. 26-29 of Lieb-Robinson Bounds in Quantum Many-Body Physics by B. Nachtergaele
More informationMultifractality in simple systems. Eugene Bogomolny
Multifractality in simple systems Eugene Bogomolny Univ. Paris-Sud, Laboratoire de Physique Théorique et Modèles Statistiques, Orsay, France In collaboration with Yasar Atas Outlook 1 Multifractality Critical
More informationIntroduction to the Mathematics of the XY -Spin Chain
Introduction to the Mathematics of the XY -Spin Chain Günter Stolz June 9, 2014 Abstract In the following we present an introduction to the mathematical theory of the XY spin chain. The importance of this
More informationA new perspective on long range SU(N) spin models
A new perspective on long range SU(N) spin models Thomas Quella University of Cologne Workshop on Lie Theory and Mathematical Physics Centre de Recherches Mathématiques (CRM), Montreal Based on work with
More informationKostka multiplicity one for multipartitions
Kostka multiplicity one for multipartitions James Janopaul-Naylor and C. Ryan Vinroot Abstract If [λ(j)] is a multipartition of the positive integer n (a sequence of partitions with total size n), and
More informationKostka multiplicity one for multipartitions
Kostka multiplicity one for multipartitions James Janopaul-Naylor and C. Ryan Vinroot Abstract If [λ(j)] is a multipartition of the positive integer n (a sequence of partitions with total size n), and
More informationLog-Convexity Properties of Schur Functions and Generalized Hypergeometric Functions of Matrix Argument. Donald St. P. Richards.
Log-Convexity Properties of Schur Functions and Generalized Hypergeometric Functions of Matrix Argument Donald St. P. Richards August 22, 2009 Abstract We establish a positivity property for the difference
More informationGroup Representations
Group Representations Alex Alemi November 5, 2012 Group Theory You ve been using it this whole time. Things I hope to cover And Introduction to Groups Representation theory Crystallagraphic Groups Continuous
More informationPrimes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st
Primes, Paul-Olivier Dehaye pdehaye@math.ethz.ch ETH Zürich, October 31 st Outline Review of Bump & Gamburd s method A theorem of Moments of derivatives of characteristic polynomials Hypergeometric functions
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux Richard P. Stanley Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 rstan@math.mit.edu Submitted: 2011; Accepted: 2011; Published: XX Mathematics
More informationQuadratic Forms of Skew Schur Functions
Europ. J. Combinatorics (1988) 9, 161-168 Quadratic Forms of Skew Schur Functions. P. GOULDEN A quadratic identity for skew Schur functions is proved combinatorially by means of a nonintersecting path
More informationPhysics 70007, Fall 2009 Answers to Final Exam
Physics 70007, Fall 009 Answers to Final Exam December 17, 009 1. Quantum mechanical pictures a Demonstrate that if the commutation relation [A, B] ic is valid in any of the three Schrodinger, Heisenberg,
More informationSecond Quantization: Quantum Fields
Second Quantization: Quantum Fields Bosons and Fermions Let X j stand for the coordinate and spin subscript (if any) of the j-th particle, so that the vector of state Ψ of N particles has the form Ψ Ψ(X
More informationLinear algebra. 1.1 Numbers. d n x = 10 n (1.1) n=m x
1 Linear algebra 1.1 Numbers The natural numbers are the positive integers and zero. Rational numbers are ratios of integers. Irrational numbers have decimal digits d n d n x = 10 n (1.1 n=m x that do
More informationCalculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm
Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen
More information5-VERTEX MODELS, GELFAND-TSETLIN PATTERNS AND SEMISTANDARD YOUNG TABLEAUX
5-VERTEX MODELS, GELFAND-TSETLIN PATTERNS AND SEMISTANDARD YOUNG TABLEAUX TANTELY A. RAKOTOARISOA 1. Introduction In statistical mechanics, one studies models based on the interconnections between thermodynamic
More informationPowers of the Vandermonde determinant, Schur functions, and the dimension game
FPSAC 2011, Reykjavík, Iceland DMTCS proc. AO, 2011, 87 98 Powers of the Vandermonde determinant, Schur functions, and the dimension game Cristina Ballantine 1 1 Department of Mathematics and Computer
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationFactorial Schur functions via the six vertex model
Factorial Schur functions via the six vertex model Peter J. McNamara Department of Mathematics Massachusetts Institute of Technology, MA 02139, USA petermc@math.mit.edu October 31, 2009 Abstract For a
More information1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary
Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More informationq-alg/ v2 15 Sep 1997
DOMINO TABLEAUX, SCH UTZENBERGER INVOLUTION, AND THE SYMMETRIC GROUP ACTION ARKADY BERENSTEIN Department of Mathematics, Cornell University Ithaca, NY 14853, U.S.A. q-alg/9709010 v 15 Sep 1997 ANATOL N.
More informationIntegrable defects: an algebraic approach
University of Patras Bologna, September 2011 Based on arxiv:1106.1602. To appear in NPB. General frame Integrable defects (quantum level) impose severe constraints on relevant algebraic and physical quantities
More informationLecture 10: A (Brief) Introduction to Group Theory (See Chapter 3.13 in Boas, 3rd Edition)
Lecture 0: A (Brief) Introduction to Group heory (See Chapter 3.3 in Boas, 3rd Edition) Having gained some new experience with matrices, which provide us with representations of groups, and because symmetries
More informationGround state and low excitations of an integrable. Institut fur Physik, Humboldt-Universitat, Theorie der Elementarteilchen
Ground state and low excitations of an integrable chain with alternating spins St Meinerz and B - D Dorfelx Institut fur Physik, Humboldt-Universitat, Theorie der Elementarteilchen Invalidenstrae 110,
More informationIntroduction to Integrability
Introduction to Integrability Problem Sets ETH Zurich, HS16 Prof. N. Beisert, A. Garus c 2016 Niklas Beisert, ETH Zurich This document as well as its parts is protected by copyright. This work is licensed
More information1 One-dimensional lattice
1 One-dimensional lattice 1.1 Gap formation in the nearly free electron model Periodic potential Bloch function x = n e iπn/ax 1 n= ψ k x = e ika u k x u k x = c nk e iπn/ax 3 n= Schrödinger equation [
More informationOn the classication of algebras
Technische Universität Carolo-Wilhelmina Braunschweig Institut Computational Mathematics On the classication of algebras Morten Wesche September 19, 2016 Introduction Higman (1950) published the papers
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationarxiv: v1 [math-ph] 24 Dec 2013
ITP-UU-13/32 SPIN-13/24 Twisted Heisenberg chain and the six-vertex model with DWBC arxiv:1312.6817v1 [math-ph] 24 Dec 2013 W. Galleas Institute for Theoretical Physics and Spinoza Institute, Utrecht University,
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationRiemann Hypotheses. Alex J. Best 4/2/2014. WMS Talks
Riemann Hypotheses Alex J. Best WMS Talks 4/2/2014 In this talk: 1 Introduction 2 The original hypothesis 3 Zeta functions for graphs 4 More assorted zetas 5 Back to number theory 6 Conclusion The Riemann
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationSimple exact solutions of one-dimensional finite-chain hard-core Bose Hubbard and Fermi Hubbard models
J. Phys. A: Math. Gen. 33 (2000) 9095 9100. Printed in the UK PII: S0305-4470(00)12795-7 Simple exact solutions of one-dimensional finite-chain hard-core Bose Hubbard and Fermi Hubbard models Feng Pan
More information2 JOSE BURILLO It was proved by Thurston [2, Ch.8], using geometric methods, and by Gersten [3], using combinatorial methods, that the integral 3-dime
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 1997 Lower Bounds of Isoperimetric Functions for Nilpotent Groups Jose Burillo Abstract. In this paper we prove that Heisenberg
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationCanonicity of Bäcklund transformation: r-matrix approach. I. arxiv:solv-int/ v1 25 Mar 1999
LPENSL-Th 05/99 solv-int/990306 Canonicity of Bäcklund transformation: r-matrix approach. I. arxiv:solv-int/990306v 25 Mar 999 E K Sklyanin Laboratoire de Physique 2, Groupe de Physique Théorique, ENS
More information(Ref: Schensted Part II) If we have an arbitrary tensor with k indices W i 1,,i k. we can act on it 1 2 k with a permutation P = = w ia,i b,,i l
Chapter S k and Tensor Representations Ref: Schensted art II) If we have an arbitrary tensor with k indices W i,,i k ) we can act on it k with a permutation = so a b l w) i,i,,i k = w ia,i b,,i l. Consider
More informationThe Erwin Schrodinger International Pasteurgasse 6/7. Institute for Mathematical Physics A-1090 Wien, Austria
ESI The Erwin Schrodinger International Pasteurgasse 6/7 Institute for Mathematical Physics A-090 Wien, Austria Why Schrodinger's Cat is Most Likely to be Either Alive or Dead H. Narnhofer W. Thirring
More informationMatrix Product States
Matrix Product States Ian McCulloch University of Queensland Centre for Engineered Quantum Systems 28 August 2017 Hilbert space (Hilbert) space is big. Really big. You just won t believe how vastly, hugely,
More informationFusion Rules and the Verlinde Formula
Proseminar Conformal Field Theory Federal Institute of Technology Zurich and String Theory Spring Term 03 Fusion Rules and the Verlinde Formula Stephanie Mayer, D-PHYS, 6 th term, stmayer@student.ethz.ch
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationDeterminant of the Schrödinger Operator on a Metric Graph
Contemporary Mathematics Volume 00, XXXX Determinant of the Schrödinger Operator on a Metric Graph Leonid Friedlander Abstract. In the paper, we derive a formula for computing the determinant of a Schrödinger
More informationTemperature Correlation Functions in the XXO Heisenberg Chain
CONGRESSO NAZIONALE DI FISICA DELLA MATERIA Brescia, 13-16 June, 1994 Temperature Correlation Functions in the XXO Heisenberg Chain F. Colomo 1, A.G. Izergin 2,3, V.E. Korepin 4, V. Tognetti 1,5 1 I.N.F.N.,
More informationQuantum wires, orthogonal polynomials and Diophantine approximation
Quantum wires, orthogonal polynomials and Diophantine approximation Introduction Quantum Mechanics (QM) is a linear theory Main idea behind Quantum Information (QI): use the superposition principle of
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationLecture notes: Quantum gates in matrix and ladder operator forms
Phys 7 Topics in Particles & Fields Spring 3 Lecture v.. Lecture notes: Quantum gates in matrix and ladder operator forms Jeffrey Yepez Department of Physics and Astronomy University of Hawai i at Manoa
More informationOn reaching head-to-tail ratios for balanced and unbalanced coins
Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More information1 Vectors. Notes for Bindel, Spring 2017 Numerical Analysis (CS 4220)
Notes for 2017-01-30 Most of mathematics is best learned by doing. Linear algebra is no exception. You have had a previous class in which you learned the basics of linear algebra, and you will have plenty
More informationGROUP THEORY PRIMER. New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule
GROUP THEORY PRIMER New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule 1. Tensor methods for su(n) To study some aspects of representations of a
More informationDeterminant of the Schrödinger Operator on a Metric Graph, by Leonid Friedlander, University of Arizona. 1. Introduction
Determinant of the Schrödinger Operator on a Metric Graph, by Leonid Friedlander, University of Arizona 1. Introduction Let G be a metric graph. This means that each edge of G is being considered as a
More informationELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices
ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Stanley, Richard P. "Two
More information114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur
EUROPHYSICS LETTERS 15 April 1998 Europhys. Lett., 42 (2), pp. 113-117 (1998) Schrodinger operator in an overfull set A. N. Gorban and I. V. Karlin( ) Computing Center RAS - Krasnoyars 660036, Russia (received
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More informationLecture 2: Review of Prerequisites. Table of contents
Math 348 Fall 217 Lecture 2: Review of Prerequisites Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this
More informationPlücker Relations on Schur Functions
Journal of Algebraic Combinatorics 13 (2001), 199 211 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Plücker Relations on Schur Functions MICHAEL KLEBER kleber@math.mit.edu Department
More informationA complete criterion for convex-gaussian states detection
A complete criterion for convex-gaussian states detection Anna Vershynina Institute for Quantum Information, RWTH Aachen, Germany joint work with B. Terhal NSF/CBMS conference Quantum Spin Systems The
More informationarxiv:q-alg/ v1 14 Feb 1997
arxiv:q-alg/97009v 4 Feb 997 On q-clebsch Gordan Rules and the Spinon Character Formulas for Affine C ) Algebra Yasuhiko Yamada Department of Mathematics Kyushu University September 8, 07 Abstract A q-analog
More informationOn Böttcher s mysterious identity
AUSTRALASIAN JOURNAL OF COBINATORICS Volume 43 (2009), Pages 307 316 On Böttcher s mysterious identity Ömer Eğecioğlu Department of Computer Science University of California Santa Barbara, CA 93106 U.S.A.
More informationGENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee
Korean J. Math. 8 (00), No., pp. 89 98 GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX Jaejin Lee Abstract. Eğecioğlu and Remmel [] gave a combinatorial interpretation
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationTrigonometric SOS model with DWBC and spin chains with non-diagonal boundaries
Trigonometric SOS model with DWBC and spin chains with non-diagonal boundaries N. Kitanine IMB, Université de Bourgogne. In collaboration with: G. Filali RAQIS 21, Annecy June 15 - June 19, 21 Typeset
More informationA DECOMPOSITION OF SCHUR FUNCTIONS AND AN ANALOGUE OF THE ROBINSON-SCHENSTED-KNUTH ALGORITHM
A DECOMPOSITION OF SCHUR FUNCTIONS AND AN ANALOGUE OF THE ROBINSON-SCHENSTED-KNUTH ALGORITHM S. MASON Abstract. We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline
More information752 Final. April 16, Fadeev Popov Ghosts and Non-Abelian Gauge Fields. Tim Wendler BYU Physics and Astronomy. The standard model Lagrangian
752 Final April 16, 2010 Tim Wendler BYU Physics and Astronomy Fadeev Popov Ghosts and Non-Abelian Gauge Fields The standard model Lagrangian L SM = L Y M + L W D + L Y u + L H The rst term, the Yang Mills
More informationCOUNTING NONINTERSECTING LATTICE PATHS WITH TURNS
COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS C. Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. e-mail: KRATT@Pap.Univie.Ac.At Abstract. We derive
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationOn Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000
On Descents in Standard Young Tableaux arxiv:math/0007016v1 [math.co] 3 Jul 000 Peter A. Hästö Department of Mathematics, University of Helsinki, P.O. Box 4, 00014, Helsinki, Finland, E-mail: peter.hasto@helsinki.fi.
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationTHE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary
THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary (The full-length article will appear in Mem. Amer. Math. Soc.) C. Krattenthaler Institut für Mathematik
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationMagnets, 1D quantum system, and quantum Phase transitions
134 Phys620.nb 10 Magnets, 1D quantum system, and quantum Phase transitions In 1D, fermions can be mapped into bosons, and vice versa. 10.1. magnetization and frustrated magnets (in any dimensions) Consider
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationSignatures of GL n Multiplicity Spaces
Signatures of GL n Multiplicity Spaces UROP+ Final Paper, Summer 2016 Mrudul Thatte Mentor: Siddharth Venkatesh Project suggested by Pavel Etingof September 1, 2016 Abstract A stable sequence of GL n representations
More informationIntroduction to Group Theory
Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)
More informationarxiv:math/ v1 [math.co] 15 Sep 1999
ON A CONJECTURED FORMULA FOR QUIVER VARIETIES ariv:math/9909089v1 [math.co] 15 Sep 1999 ANDERS SKOVSTED BUCH 1. Introduction The goal of this paper is to prove some combinatorial results about a formula
More informationPhysics 221A Fall 2005 Homework 8 Due Thursday, October 27, 2005
Physics 22A Fall 2005 Homework 8 Due Thursday, October 27, 2005 Reading Assignment: Sakurai pp. 56 74, 87 95, Notes 0, Notes.. The axis ˆn of a rotation R is a vector that is left invariant by the action
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationKRONECKER POWERS CHARACTER POLYNOMIALS. A. Goupil, with C. Chauve and A. Garsia,
KRONECKER POWERS AND CHARACTER POLYNOMIALS A. Goupil, with C. Chauve and A. Garsia, Menu Introduction : Kronecker products Tensor powers Character Polynomials Perspective : Duality with product of conjugacy
More informationTHE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX
THE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX RICHARD P. STANLEY Abstract. LetJT λ bethejacobi-trudimatrixcorrespondingtothepartitionλ, sodetjt λ is the Schur function s λ in the variables
More informationLittlewood Richardson polynomials
Littlewood Richardson polynomials Alexander Molev University of Sydney A diagram (or partition) is a sequence λ = (λ 1,..., λ n ) of integers λ i such that λ 1 λ n 0, depicted as an array of unit boxes.
More informationHigher dimensional dynamical Mordell-Lang problems
Higher dimensional dynamical Mordell-Lang problems Thomas Scanlon 1 UC Berkeley 27 June 2013 1 Joint with Yu Yasufuku Thomas Scanlon (UC Berkeley) Higher rank DML 27 June 2013 1 / 22 Dynamical Mordell-Lang
More information