• Corpus ID: 18176187

Meander Determinants

  title={Meander Determinants},
  author={Philippe Di Francesco},
We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a given number of points. This is done by the explicit Gram-Schmidt orthogonalization of certain bases of subspaces of the Temperley-Lieb algebra. 
The Meander Determinant and Its Generalizations
We investigate various generalizations of meanders, that is, configurations of non-self-intersecting loops crossing a line through a given number of points. In all cases, we derive explicit formulas
SU(N) meander determinants
We propose a generalization of meanders, i.e., configurations of non-self-intersecting loops crossing a line through a given number of points, to SU(N). This uses the reformulation of meanders as
Representations of the Temperley-Lieb Algebra via a New Inner Product on Half-Diagrams
We describe an inner product on the diagrams on which the Temperley-Lieb algebra can be represented. We exhibit several constructions which are in natural combinatorial bijection with these diagrams,
The Gram determinant for plane curves
We investigate the Gram determinant of the pairing arising from curves in a planar surface, with a focus on the disk with two holes. We prove that the determinant based on n 1 curves divides the
The Gram determinant of the type B Temperley-Lieb algebra
Gram determinant of planar curves
We investigate the Gram determinant of the bilinear form based on curves in a planar surface, with a focus on the disk with two holes. We prove that the determinant based on $n-1$ curves divides the
Cyclotomic expansion of exceptional spectral measures
We find explicit formulae for the circular spectral measures of $E_7,E_8$. This leads to a number of general observations regarding the ADE circular measures: these are linear combinations of
A Gram determinant for Lickorish's bilinear form
  • X. Cai
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2011
Abstract We use the Jones–Wenzl idempotents to construct a basis of the Temperley–Lieb algebra TLn. This allows a short calculation for a Gram determinant of Lickorish's bilinear form on the
Two-dimensional topological theories, rational functions and their tensor envelopes
We study generalized Deligne categories and related tensor envelopes for the universal two-dimensional cobordism theories described by rational functions, recently defined by Sazdanovic and one of
Bilinear forms on skein modules and steps in Dyck paths
We use Jones-Wenzl idempotents to construct bases for the relative Kauffman bracket skein module of a square with n points colored 1 and one point colored h. We consider a natural bilinear form on


Meanders and the Temperley-Lieb algebra
The statistics of meanders is studied in connection with the Temperley-Lieb algebra. Each (multi-component) meander corresponds to a pair of reduced elements of the algebra. The assignment of a
We review the construction of integrable height models attached to graphs, in connection with compact Lie groups. The continuum limit of these models yields conformally invariant field theories. A
A combinatorial matrix in $3$-manifold theory.
In this paper we study the matrix A(n) which was defined by W. B. R. Lickorish [3]. We prove a result required by Lickorish which completes his topological and combinatorial approach to the
Meander, Folding and Arch Statistics
The statistics of meander and related problems are studied as particular realizations of compact polymer chain foldings. This paper presents a general discussion of these topics, with a particular
Strings, Matrix Models, and Meanders
Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
  • H. Temperley, E. Lieb
  • Mathematics
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1971
A transfer-matrix approach is introduced to calculate the 'Whitney polynomial’ of a planar lattice, which is a generalization of the ‘percolation’ and ‘colouring’ problems. This new approach turns
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
This paper describes an O(n)-time algorithm for recognizing and sorting Jordan sequences that uses level-linked search trees and a reduction of the recognition and sorting problem to a list-splitting problem.
A map-folding problem
Introduction. In how many ways can a map be folded up? What follows is restricted to the one-dimensional problem, that is: Given a plane chain ('map') of p equal segments ('leaves') jointed together,
Science Selecta Math. Sov
  • Science Selecta Math. Sov
  • 1992