Path generating transforms
Abstract
We study combinatorial aspects of q-weighted, length-L Forrester-Baxter paths, Pp, p'a, b, c(L), where p, p', a, b, c ∈ Z+, 0 < p < p', 0 < a, b, c < p', c = b 1, L+a-b 0 (mod 2), and p and p' are co-prime. We obtain a bijection between Pp, p'a, b, c(L) and partitions with certain prescribed hook differences. Thereby, we obtain a new description of the q-weights of Pp, p'a, b, c(L). Using the new weights, and defining s0 and r0 to be the smallest non-negative integers for which |p s0 - p' r0|=1, we restrict the discussion to Pp, p's0 Pp, p's0,s0,s0+1(L), and introduce two combinatorial transforms: 1. A Bailey-type transform B: Pp, p's0(L) -> Pp, p'+ps0 + r0(L'), L ≤ L', 2. A duality-type transform D: Pp, p's0(L) -> Pp'-p, p's0(L). We study the action of B and D, as q-polynomial transforms on the Pp, p's0(L) generating functions, p, p's0(L). In the limit L -> ∈finity, p, p's0(L) reduces to the Virasoro characters, p, p'r0, s0, of minimal conformal field theories Mp, p', or equivalently, to the one-point functions of regime-III Forrester-Baxter models. As an application of the B and D transforms, we re-derive the constant-sign expressions for p, p'r0, s0, first derived by Berkovich and McCoy.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.