[Paper Review] Bosonic formulas for (k,l)-admissible partitions

Boris Feigin, M. Jimbo+3 more|ArXiv.org|Jul 6, 2001

Advanced Mathematical Identities2 references4 citations

TL;DR

This paper derives bosonic formulas for the generating series of (k,l)-admissible partitions by solving a system of q-difference matrix equations. The key result is a finite sum expression involving (l−1)-fold series, each term parameterized by non-negative integers and structured as a rational function in q and z, with explicit formulas for exponents and denominators.

ABSTRACT

Bosonic formulas for generating series of partitions with certain restrictions are obtained by solving a set of linear matrix q-difference equations. Some particular cases are related to combinatorial problems arising from solvable lattice models, representation theory and conformal field theory.

Motivation & Objective

• To derive a closed-form bosonic formula for the generating series of (k,l)-admissible partitions in the infinite volume limit.
• To address the combinatorial structure of (k,l)-admissible partitions defined by linear constraints on integer sequences.
• To develop a method based on extremal points of a polytope defined by inequalities (1.1) and their evolution under recurrence relations.
• To explain the surprising cancellation of exponentially many terms in the generating function, leaving only polynomially many terms.
• To establish a connection between q-difference equations and the structure of extremal configurations in the polytope.

Proposed method

• Formulate the generating series χ_{k,l}^{(N)}(q,z) as a sum over (k,l)-configurations satisfying constraints (1.1) and (2.1).
• Derive a q-difference matrix equation by introducing a recurrence that adds x₀ to the left end of the sequence, preserving boundary conditions.
• Construct extremal points of the (N+1)-polytope from those of the N-polytope using operators A and B, which correspond to creating new extremal configurations.
• Use a cancellation mechanism between monomials in the generating function, where pairs of terms with opposite signs cancel out.
• Apply induction and vector-part tracking to analyze the evolution of monomials under the action of A and B operators, particularly focusing on the behavior at key points (↑, ↓).
• Express the final result as a finite sum of (l−1)-fold series, each term of the form (-1)^α q^β z^γ / [(q)_{t₂}⋯(q)_{t_l} (q^{∑_{c=2}^l t_c} z)_∞], with explicit formulas for α, β, γ.

Experimental results

Research questions

• RQ1 How can the generating series for (k,l)-admissible partitions be expressed in a closed bosonic form in the infinite volume limit?
• RQ2 What is the mechanism behind the cancellation of exponentially many terms in the extremal point expansion, leaving only a polynomial number of terms?
• RQ3 How do the recurrence relations based on left-end insertion (x₀) lead to a solvable q-difference matrix equation?
• RQ4 What is the precise structure of the remaining non-cancelled terms after the pairing mechanism?
• RQ5 How do the vector and scalar parts of the monomials in the generating function evolve under the action of the A and B operators?

Key findings

• The generating series χ_{k,l}(q,z) is expressed as a finite sum of (l−1)-fold series, each term being a rational function in q and z.
• The final formula has the form ∑ (-1)^α q^β z^γ / [(q)_{t₂}⋯(q)_{t_l} (q^{∑_{c=2}^l t_c} z)_∞], with explicit expressions for α, β, γ in terms of t_c, m_c, and μ_c.
• The exponent α is given by α = n − t₁ + ∑_{c=1}^l m_c, where n is the total number of operators, t_c is the total length of color c blocks, and m_c is the number of blocks of color c.
• The exponent β is β̄ = n m₁ + ½ ∑_{c=2}^l t_c(t_c + 1) − ∑_{c=1}^l μ_c, where μ_c = ∑_{i:C_i=B_c} (n−i+1).
• The method successfully reduces an exponentially growing set of extremal configurations to a finite sum through a non-trivial cancellation mechanism.
• The cancellation mechanism is not fully understood, but it is shown to occur systematically via pairing of monomials with opposite signs, supported by induction and vector-part tracking.