Abstract
The number b(n) of modes of connections of 2n points permissible under Baxter's generalization of the Temperley-Lieb operators is found to be
In particular b(n) differs from the Schröder number sn for n ⩾ 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Baxter, private communication
L. Comtet, Advanced Combinatories D. Reidel, Dovdrecht (1974)
J. Riordan ‘The distribution of crossings of chords joining pairs of 2n points on a circle', Mathematics of Computation, 29 (1975), 215–222
D.G. Rogers, ‘The enumeration of a family of ladder graphs Part I. Connective relations', Quart.J.Math. Oxford (2), (to appear)
D.G. Rogers, ‘The enumeration of a family of ladder graphs Part II. Schröder relations', (submitted).
D.G. Rogers and L.W. Shapiro, 'some correspondences involving the Schröder numbers and relations', Proceedings of International Conference on Combinatorial theory, Canberra (1977) (to appear).
N.J.A. Sloane, ‘A handbook of integer sequences’ Academic Press, New York (1973)
H.N.V. Temperley and E.H. Lieb, ‘Relations between the ‘percolation’ and ‘colouring’ problem and other graph theoretical problems associated with regular planar lattices: Some exact results for the ‘percolation’ problem', Proc.Roy.Soc. Ser.A., 322 (1971), 251–280
E.T. Whittaker and G.N. Watson, ‘A course of modern analysis’ 4th ed. C.U.P., Cambridge (1950).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Temperley, H.N.V., Rogers, D.G. (1978). A note on baxter's generalization of the temperley-lieb operators. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062548
Download citation
DOI: https://doi.org/10.1007/BFb0062548
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive