12.07.2015 Views

Contributions à l'Etude du Vertex Topologique en Théorie ... - Toubkal

Contributions à l'Etude du Vertex Topologique en Théorie ... - Toubkal

Contributions à l'Etude du Vertex Topologique en Théorie ... - Toubkal

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

324 L.B. Drissi et al. / Nuclear Physics B 801 [FS] (2008) 316–345The g<strong>en</strong>erating functional of 3d partitions requires, in the framework of transfer method, thefollowing 2 ( ∏−1(Ψ − (1)|0〉= Γ− (1)q L )) 0|0〉,(3.11)t=−∞together with(∏ ∞(〈0|Ψ + (1) =〈0| qL 0Γ + (1) )) .t=0(3.12)Notice in passing that in Eqs. (3.11)–(3.12), the pro<strong>du</strong>cts ∏ −1t=−∞ (···) and ∏ ∞t=0 (···) are tak<strong>en</strong>over diagonal slices of the 3d partitions. These pro<strong>du</strong>cts are typical ones in the transfer matrixmethod where a 3d partition is thought of as a bound state from the slice at t =−∞(in-state) tothe slice at t =+∞(out-state). The action by the operator Γ − (1) allows to g<strong>en</strong>erate all possible2d-partitions on a giv<strong>en</strong> diagonal slice as shown on Eq. (2.22). The relation (2.16) permits tomove from a slice to an other by creating all possible partitions interlacing with the partitions inthe previous slice.Therefore, using Eq. (2.16) and q L 0|0〉=|0〉, the states (3.11)–(3.12) can be rewritt<strong>en</strong> as(∏ ∞(Ψ − (1)|0〉= Γ − qk )) |0〉,(3.13)k=0and similar relation for 〈0|Ψ + (1). We de<strong>du</strong>ce from this relation the two following:(i) 3d partitions can be realized in terms of an infinite 2d ones,(ii) the g<strong>en</strong>erating functional of 3d partitions are captured by the local vertex operators 3( s∏(Ψ − (1) = lim Γ − qk )) q sL 0,(3.14)s→∞k=0and its <strong>du</strong>al Ψ + (1). These Ψ ± operators will be d<strong>en</strong>oted later asΨ ± (z) = Γ ± (2) (z),(3.15)but to keep the notations simpler, we will mom<strong>en</strong>tary use Ψ ± (z) and come later to the Γ ±(2)wh<strong>en</strong> we consider p-dim<strong>en</strong>sional g<strong>en</strong>eralization.3.2. More on 3d g<strong>en</strong>erating functionThe partition function Z 3d g<strong>en</strong>erating 3d-g<strong>en</strong>eralized Young diagrams is giv<strong>en</strong>, in the transfermatrix language, as follows( ∞) (∏−1)∏Z 3d =〈0| q L 0Γ + (1) q L 0Γ − (1)q L 0|0〉.(3.16)t=0t=−∞2 Note that Ψ ± (1) corresponds to Ψ ± (z) with z = 1. Note also that Ψ ± (1) dep<strong>en</strong>d on the q-parameter; it has be<strong>en</strong>dropped out for simplicity of notations.3 It should be noted that a 3d partition is a collection of Young diagrams. However, an arbitrary collection of Youngdiagrams do not correspond to a 3d partition.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!