Abstract
We investigate the connection between Tamari lattices and the Thompson group F, summarized in the fact that F is a group of fractions for a certain monoid \( {F^+_{\rm sym}} \)whose Cayley graph includes all Tamari lattices. Under this correspondence, the Tamari lattice meet and join are the counterparts of the least common multiple and greatest common divisor operations in \( {F^+_{\rm sym}} \). As an application, we show that, for every n, there exists a length l chain in the nth Tamari lattice whose endpoints are at distance at most 12l/n.
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
J.L. Baril and J.M.. Pallo, “Efficient lower and upper bounds of the diagonal-flip distance between triangulations”, Inform. Proc. Letters 100 (2006) 131–136.
A. Björner and M. Wachs, “Shellable nonpure complexes and posets. II”, Trans. Amer. Math. Soc. 349 (1997) 3945–3975.
M. Brin and C. Squier, “Groups of piecewise linear homeomorphisms of the real line”, Invent. Math. 79 (1985) 485–498.
J.W. Cannon and W.J. Floyd, “What is Thompson’s group?”, Notices of the AMS 58-8 (2011) 1112–1113.
J.W. Cannon, W.J. Floyd, and W.R. Parry, “Introductory notes on Richard Thompson’s groups”, Enseign. Math. 42 (1996) 215–257.
A. Clifford and G. Preston, The algebraic theory of semigroups, volume 1, Amer. Math. Soc. Surveys, vol. 7, Amer. Math. Soc., 1961.
P. Dehornoy, “The structure group for the associativity identity”, J. Pure Appl. Algebra 111 (1996) 59–82.
P. Dehornoy, “Groups with a complemented presentation”, J. Pure Appl. Algebra 116 (1997) 115–137.
P. Dehornoy, Braids and Self-Distributivity, Progress in Math., vol. 192, Birkhäuser, 2000.
P. Dehornoy, “Study of an identity”, Algebra Universalis 48 (2002) 223–248.
P. Dehornoy, “Complete positive group presentations”, J. of Algebra 268 (2003) 156–197.
P. Dehornoy, “Geometric presentations of Thompson’s groups”, J. Pure Appl. Algebra 203 (2005) 1–44.
P. Dehornoy, “On the rotation distance between binary trees”, Advances in Math. 223 (2010) 1316–1355.
P. Dehornoy, “The word reversing method”, Intern. J. Alg. and Comput. 21 (2011) 71–118.
P. Dehornoy, with F. Digne, E. Godelle, D. Krammer, and J. Michel, “Garside Theory”, Book in progress, http://www.math.unicaen.fr/~garside/Garside.pdf .
O. Deiser, “Notes on the Polish Algorithm”, http://page.mi.fu-berlin.de/deiser/wwwpublic/ psfiles/polish.ps.
H. Friedman and D. Tamari, “Problèmes d’associativité: Une structure de treillis finis induite par une loi demi-associative”, J. Combinat. Th. 2 (1967) 215–242.
V.S. Guba, “The Dehn function of Richard Thompson’s group F is quadratic”, Invent. Math. 163 (2006) 313–342.
S. Huang and D. Tamari, “Problems of associativity: A simple proof for the lattice property of systems ordered by a semi-associative law”, J. Combinat. Th. Series A 13 (1972) 7–13.
D. Krammer, “A class of Garside groupoid structures on the pure braid group”, Trans. Amer. Math. Soc. 360 (2008) 4029–4061.
S. Mac Lane, Natural associativity and commutativity, Rice University Studies, vol. 49, 1963.
R. McKenzie and R.J. Thompson, “An elementary construction of unsolvable word problems in group theory”, in Word Problems, Boone and al, eds., Studies in Logic, vol. 71, North-Holland, 1973,457–478.
J.M. Pallo, “Enumerating, ranking and unranking binary trees”, The Computer Journal 29 (1986) 171–175.
J.M. Pallo, “An algorithm to compute the Möbius function of the rotation lattice of binary trees”, RAIRO Inform. Théor. Applic. 27 (1993) 341–348.
D. Sleator, R. Tarjan, and W. Thurston, “Rotation distance, triangulations, and hyperbolic geometry”, J. Amer. Math. Soc. 1 (1988) 647–681.
R. Stanley, Enumerative Combinatorics, vol. 2, Cambridge Studies in Advances Math., no. 62, Cambridge Univ. Press, 2001.
J.D. Stasheff, “Homotopy associativity of H-spaces”, Trans. Amer. Math. Soc. 108 (1963) 275–292.
Z. šunić, “Tamari lattices, forests and Thompson monoids”, Europ. J. Combinat. 28 (2007) 1216–1238.
D. Tamari, “The algebra of bracketings and their enumeration”, Nieuw Archiefvoor Wiskunde 10 (1962) 131–146.
R.J. Thompson, “Embeddings into finitely generated simple groups which preserve the word problem”, in Word Problems II, Adian, Boone, and Higman, eds., Studies in Logic, North- Holland, 1980,401–441.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Basel
About this chapter
Cite this chapter
Dehornoy, P. (2012). Tamari Lattices and the Symmetric Thompson Monoid. In: Müller-Hoissen, F., Pallo, J., Stasheff, J. (eds) Associahedra, Tamari Lattices and Related Structures. Progress in Mathematics, vol 299. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0405-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0405-9_11
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0404-2
Online ISBN: 978-3-0348-0405-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)