12,976 research outputs found

    Open boundary Quantum Knizhnik-Zamolodchikov equation and the weighted enumeration of Plane Partitions with symmetries

    Full text link
    We propose new conjectures relating sum rules for the polynomial solution of the qKZ equation with open (reflecting) boundaries as a function of the quantum parameter qq and the τ\tau-enumeration of Plane Partitions with specific symmetries, with τ=−(q+q−1)\tau=-(q+q^{-1}). We also find a conjectural relation \`a la Razumov-Stroganov between the τ→0\tau\to 0 limit of the qKZ solution and refined numbers of Totally Symmetric Self Complementary Plane Partitions.Comment: 27 pages, uses lanlmac, epsf and hyperbasics, minor revision

    Quantum Knizhnik-Zamolodchikov equation: reflecting boundary conditions and combinatorics

    Full text link
    We consider the level 1 solution of quantum Knizhnik-Zamolodchikov equation with reflecting boundary conditions which is relevant to the Temperley--Lieb model of loops on a strip. By use of integral formulae we prove conjectures relating it to the weighted enumeration of Cyclically Symmetric Transpose Complement Plane Partitions and related combinatorial objects

    The solution of the quantum A1A_1 T-system for arbitrary boundary

    Full text link
    We solve the quantum version of the A1A_1 TT-system by use of quantum networks. The system is interpreted as a particular set of mutations of a suitable (infinite-rank) quantum cluster algebra, and Laurent positivity follows from our solution. As an application we re-derive the corresponding quantum network solution to the quantum A1A_1 QQ-system and generalize it to the fully non-commutative case. We give the relation between the quantum TT-system and the quantum lattice Liouville equation, which is the quantized YY-system.Comment: 24 pages, 18 figure

    Discrete integrable systems, positivity, and continued fraction rearrangements

    Full text link
    In this review article, we present a unified approach to solving discrete, integrable, possibly non-commutative, dynamical systems, including the QQ- and TT-systems based on ArA_r. The initial data of the systems are seen as cluster variables in a suitable cluster algebra, and may evolve by local mutations. We show that the solutions are always expressed as Laurent polynomials of the initial data with non-negative integer coefficients. This is done by reformulating the mutations of initial data as local rearrangements of continued fractions generating some particular solutions, that preserve manifest positivity. We also show how these techniques apply as well to non-commutative settings.Comment: 24 pages, 2 figure

    Polynomial Fusion Rings of Logarithmic Minimal Models

    Full text link
    We identify quotient polynomial rings isomorphic to the recently found fundamental fusion algebras of logarithmic minimal models.Comment: 18 page

    Sum rules for the ground states of the O(1) loop model on a cylinder and the XXZ spin chain

    Full text link
    The sums of components of the ground states of the O(1) loop model on a cylinder or of the XXZ quantum spin chain at Delta=-1/2 (of size L) are expressed in terms of combinatorial numbers. The methods include the introduction of spectral parameters and the use of integrability, a mapping from size L to L+1, and knot-theoretic skein relations.Comment: final version to be publishe

    A Sharing- and Competition-Aware Framework for Cellular Network Evolution Planning

    Get PDF
    Mobile network operators are facing the difficult task of significantly increasing capacity to meet projected demand while keeping CAPEX and OPEX down. We argue that infrastructure sharing is a key consideration in operators' planning of the evolution of their networks, and that such planning can be viewed as a stage in the cognitive cycle. In this paper, we present a framework to model this planning process while taking into account both the ability to share resources and the constraints imposed by competition regulation (the latter quantified using the Herfindahl index). Using real-world demand and deployment data, we find that the ability to share infrastructure essentially moves capacity from rural, sparsely populated areas (where some of the current infrastructure can be decommissioned) to urban ones (where most of the next-generation base stations would be deployed), with significant increases in resource efficiency. Tight competition regulation somewhat limits the ability to share but does not entirely jeopardize those gains, while having the secondary effect of encouraging the wider deployment of next-generation technologies

    Loop model with mixed boundary conditions, qKZ equation and alternating sign matrices

    Full text link
    The integrable loop model with mixed boundary conditions based on the 1-boundary extended Temperley--Lieb algebra with loop weight 1 is considered. The corresponding qKZ equation is introduced and its minimal degree solution described. As a result, the sum of the properly normalized components of the ground state in size L is computed and shown to be equal to the number of Horizontally and Vertically Symmetric Alternating Sign Matrices of size 2L+3. A refined counting is also considered

    Inhomogeneous loop models with open boundaries

    Full text link
    We consider the crossing and non-crossing O(1) dense loop models on a semi-infinite strip, with inhomogeneities (spectral parameters) that preserve the integrability. We compute the components of the ground state vector and obtain a closed expression for their sum, in the form of Pfaffian and determinantal formulas.Comment: 42 pages, 31 figures, minor corrections, references correcte

    The Razumov-Stroganov conjecture: Stochastic processes, loops and combinatorics

    Full text link
    A fascinating conjectural connection between statistical mechanics and combinatorics has in the past five years led to the publication of a number of papers in various areas, including stochastic processes, solvable lattice models and supersymmetry. This connection, known as the Razumov-Stroganov conjecture, expresses eigenstates of physical systems in terms of objects known from combinatorics, which is the mathematical theory of counting. This note intends to explain this connection in light of the recent papers by Zinn-Justin and Di Francesco.Comment: 6 pages, 4 figures, JSTAT News & Perspective
    • …
    corecore