2023-02-07T09:08:43Zhttps://keep.lib.asu.edu/oai/requestoai:keep.lib.asu.edu:node-1549262021-08-30T18:21:23Zoai_pmh:alloai_pmh:repo_items154926
https://hdl.handle.net/2286/R.I.40281
http://rightsstatements.org/vocab/InC/1.0/
All Rights Reserved
2016
viii, 72 pages : illustrations
Doctoral Dissertation
Academic theses
Text
eng
Nelson, Luke
Fishel, Susanna
Czygrinow, Andrzej
Jones, John
Kierstead, Henry
Spielberg, John
Arizona State University
Partial requirement for: Ph.D., Arizona State University, 2016
Includes bibliographical references (pages 67-70)
Field of study: Mathematics
The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the attention they have received, a formula for the number of maximal chains in the Tamari lattices is still unknown. The purpose of this thesis is to convey my results on progress toward the solution of this problem and to discuss future work.<br/><br/>A few years ago, Bergeron and Préville-Ratelle generalized the Tamari lattices to the m-Tamari lattices. The original Tamari lattices T(n) are the case m=1. I establish a bijection between maximum length chains in the m-Tamari lattices and standard m-shifted Young tableaux. Using Thrall’s formula, I thus derive the formula for the number of maximum length chains in T(n).<br/><br/>For each i greater or equal to -1 and for all n greater or equal to 1, I define C(i,n) to be the set of maximal chains of length n+i in T(n). I establish several properties of maximal chains (treated as tableaux) and identify a particularly special property: each maximal chain may or may not possess a plus-full-set. I show, surprisingly, that for all n greater or equal to 2i+4, each member of C(i,n) contains a plus-full-set. Utilizing this fact and a collection of maps, I obtain a recursion for the number of elements in C(i,n) and an explicit formula based on predetermined initial values. The formula is a polynomial in n of degree 3i+3. For example, the number of maximal chains of length n in T(n) is n choose 3.<br/><br/>I discuss current work and future plans involving certain equivalence classes of maximal chains in the Tamari lattices. If a maximal chain may be obtained from another by swapping a pair of consecutive edges with another pair in the Hasse diagram, the two maximal chains are said to differ by a square move. Two maximal chains are said to be in the same equivalence class if one may be obtained from the other by making a set of square moves.
Mathematics
Enumeration
Maximal Chains
Tamari Lattices
Lattice theory
Combinatorial enumeration problems
Partially ordered sets
Maximal subgroups
Toward the enumeration of maximal chains in the Tamari lattices