Supersymmetric Matrix Models and the Meander Problem
نویسنده
چکیده
We consider matrix-model representations of the meander problem which describes, in particular, combinatorics for foldings of closed polymer chains. We introduce a supersymmetric matrix model for describing the principal meander numbers. This model is of the type proposed by Marinari and Parisi for discretizing a superstring in D = 1 while the supersymmetry is realized in D = 0 as a rotational symmetry between bosonic and fermionic matrices. Using non-commutative sources, we reformulate the meander problem in a Boltzmannian Fock space whose annihilation and creation operators obey the Cuntz algebra. We discuss also the relation between the matrix models describing the meander problem and the Kazakov–Migdal model on a D-dimensional lattice. ∗ E–mail: [email protected] / [email protected]
منابع مشابه
Fermionic Matrix Models
We review a class of matrix models whose degrees of freedom are matrices with anticommuting elements. We discuss the properties of the adjoint fermion one-, twoand gauge invariant D-dimensional matrix models at large-N and compare them with their bosonic counterparts which are the more familiar Hermitian matrix models. We derive and solve the complete sets of loop equations for the correlators ...
متن کاملExact Meander Asymptotics: a Numerical Check
This note addresses the meander enumeration problem: “Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points”. We review a description of meanders introduced recently in terms of the coupling to gravity of a two-flavored fully-packed loop model. The subsequent analytic predictions for various meandric c...
متن کاملBernoulli matrix approach for matrix differential models of first-order
The current paper contributes a novel framework for solving a class of linear matrix differential equations. To do so, the operational matrix of the derivative based on the shifted Bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. An error estimation of presented method is provided. Numerical experiments are...
متن کاملAn interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers
The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...
متن کاملMatrix Model Combinatorics: Applications to Folding and Coloring
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these to the study of various folding problems arising from physics, including: the meander (or polymer folding) problem “enumeration of all topologically inequiva...
متن کامل