WorksMathematics
Bijecting -Tamari intervals, trees, and tight gradings
Abstract
Tight gradings, which are certain integer gradings on maximal Dyck paths, provide a combinatorial framework for computing all coefficients of wall-functions in rank- cluster scattering diagrams. We construct a bijection between a special subset of tight gradings and the intervals of the -Tamari lattice, providing a new combinatorial proof of the central wall-function formula proved by Reineke. Inspired by the structure of these gradings, we introduce a class of plane trees called -leafy trees that give a new model for -Tamari intervals. The defining condition of an -leafy tree is simple: in every full subtree, the number of leaves is greater than times the number of internal vertices. The leafy tree perspective gives rise to a quadratic functional equation with a catalytic parameter, providing an alternative way to enumerate -Tamari intervals.
Introduction
The Tamari lattice , introduced by Tamari in 1951, is the partial order on binary trees with internal vertices generated by rotations. Its Hasse diagram is an orientation of the edge graph of an associahedron, linking Catalan combinatorics with the geometry of associativity. Tamari intervals, namely comparable pairs in , gained sustained interest after Chapoton showed in 2006 [10] that they are counted by . This simple formula inspired the development of several combinatorial models, for example [3, 11, 12].
Bergeron observed that Chapoton’s formula coincides with Haiman’s conjectural dimension of the alternating component of the -module of trivariate diagonal harmonics. Motivated by -variant versions of these spaces, he introduced the -Tamari lattice [2] and conjectured that its intervals are counted by
Bousquet-Mélou, Fusy, and Préville-Ratelle subsequently proved this formula counting the -Tamari intervals [5].
More recently Chapoton observed that the numbers (1) also coincide with the Euler characteristics of a family of Kronecker moduli spaces [1], which were computed by Weist [21]. These Kronecker moduli are known to be closely related to scattering diagrams in rank 2 [20, 15, 9].
Our approach to -Tamari intervals arises from the computation of cluster scattering diagrams [14]. In prior work [8], the authors introduced tight gradings, which provide a uniform combinatorial formula for wall-function coefficients in any rank-2 cluster scattering diagram. These gradings on Dyck paths are built on Lee–Li–Zelevinsky’s compatible pairs [16], and play a crucial role in extending Laurent positivity to generalized cluster algebras [7]. While seeking a combinatorial enumeration of tight gradings associated with the central wall, we noticed that the number of 0-framed tight gradings is precisely that of -Tamari intervals. This equinumerosity motivated us to look for an explicit combinatorial connection.
To establish this connection, we introduce -leafy trees as a novel plane tree model for -Tamari intervals. Their defining condition is surprisingly simple: in every full rooted subtree, the number of leaves is strictly larger than times the number of internal vertices. These trees serve as intermediate objects bridging -Tamari intervals and tight gradings.
The main aim of this extended abstract is to present the bijections between these three sets of combinatorial objects:
(I) intervals in the -Tamari lattice of order ,
(II) -leafy trees on internal vertices and leaves, and
(III) 0-framed tight gradings contributing to the th central wall coefficient of the cluster scattering diagram .
The corresponding -Tamari interval in (I) can be read directly from the right-to-left preorder of a leafy tree in (II): the maximum element records whether each vertex is internal or a leaf, while the minimum element records the arities of the internal vertices. Moreover, we extend the bijection between (II) and (III) to a bijection between -leafy trees with a distinguished vertex and the set of all tight gradings contributing to the th central wall coefficient of .
The bijection to -leafy trees yields several nice consequences for -Tamari intervals. The recursive structure of leafy trees makes them easy to generate and enumerate, and they yield a comparability test for -Tamari elements as a positivity condition on plane trees. We find that a generating series for -leafy trees, refined by two tree statistics, satisfies the functional equation (7) obtained in [5] for -Tamari intervals. We also derive a new quadratic functional equation (10) with one catalytic parameter using the tree structure. Solving this equation gives an alternative simpler derivation of the formula (1). The obvious left-right symmetry on -leafy trees induces an involution on -Tamari intervals which was not previously identified, to the best of our knowledge.
The connection with tight gradings gives a second application. Although tight gradings are proven to compute wall coefficients [7], we had not been able to combinatorially enumerate them, even for the central wall, until linking them with leafy trees. So the tree perspective provides a new proof of the central wall formula for , conjectured by Kontsevich in a closely related setting of tropical vertex [15] and proved by Reineke using quiver representations [19, 9].
A tree model for -Tamari intervals
In this section, we review the -Tamari lattice and its intervals, introduce -leafy trees, and describe the bijection from -leafy trees to -Tamari intervals.
Intervals in the -Tamari lattice
Dyck paths of size form the Tamari lattice . An -ballot path of size is a word with letters and letters such that every prefix satisfies , where is the number of letter in . Equivalently, it is a north-east lattice path from to that stays non-strictly above . Thus -ballot paths generalize Dyck paths where .
Definition 2.1. For and two -ballot paths of size , define if there exists in an east step , followed by a north step , such that is obtained from by swapping and , where is the shortest factor of that begins with and is a (translated) -ballot path.
The transitive closure of defines a lattice on -ballot paths of size , which we call the -Tamari lattice , generalizing . Any pair with is an interval and we denote it by . Write for the set of all intervals.
Figure 1. For the Hasse diagram of the Tamari lattice (left), we depict the leafy trees (center) and tight gradings (right) corresponding to the vertices and edges. The intervals of size greater than 2 are described below.
We refer the reader to [5] for a more comprehensive exposition on -Tamari lattices and their intervals. We note that there have been combinatorial models for -Tamari intervals, for example [11, 18], and it would be interesting to understand the relation with our tree model introduced below.
m-leafy trees
All trees considered here are finite plane trees; in particular, there is a designated root and the children of each internal vertex (i.e. non-leaf vertex) are ordered from left to right. In our illustrations, the root is always placed at the top.
A subtree of a tree is a plane tree rooted at a vertex of spanned by all descendants of , and is denoted by .
Let denote the number of leaves of and the number of internal vertices.
Fix a positive integer . The following notion of -leafy trees is central to our discussion but remarkably simple.
Definition 2.2 (-leafy trees). A tree is called -leafy if for every vertex ,
Despite this simple characterization, the class of -leafy trees seems not to have drawn much attention in combinatorics. However, some special cases are familiar families. For example, -leafy trees with for every are precisely -ary trees.

Figure 2. A 2-leafy tree with next to each vertex .
For , write . Equivalently, is the set of -leafy trees with internal vertices and leaves.
Bijecting m-leafy trees and m-Tamari intervals
The promised bijection is easy to describe.
Let be a tree. The right-to-left preorder of is defined to visit the root first, then recursively visit the children from right to left. List among all vertices the internal vertices in this order . Let be the arity of , the number of children of .
We associated the upper and lower words to :

Figure 3. A 2-leafy tree in and the associated words.
Theorem 2.5. If , then and are -ballot paths with . Moreover, the map below is a bijection:
Next we discuss some consequences of the above tree model of -Tamari intervals.
A plane tree is called a caterpillar if its internal vertices form a chain. A caterpillar is called a left (resp. right) caterpillar if any internal vertex is the leftmost (resp. rightmost) child of its parent.
The bijection gives rise to three models for the -Tamari lattice:
Left -leafy caterpillars are length-zero intervals, namely -ballot paths;
Right -leafy caterpillars are intervals whose upper path is maximal;
-ary trees are intervals whose lower path is minimal.

Figure 4. A left caterpillar, a right caterpillar, and a ternary tree corresponding to the same 2-ballot path .
The third model is a well-known -ary tree description of the -Tamari lattice. The cover relation is realized as certain tree rotation, which was already pointed out in [5 Section 4].
We may characterize the -leafy trees that correspond to cover relations in . See Figure 5 for an example.

Figure 5. A 2-leafy tree that is a cover relation.
Proposition 2.7. For , the interval is a cover relation if and only if the two conditions hold:
has precisely one internal vertex that is the second leftmost child of its parent, and any other non-root internal vertex is the leftmost child of its parent.
for any internal descendant of .
The left-right reflection of plane trees defines an involution . In particular, it sends a left caterpillar to its mirrored right caterpillar, and vice versa. The set of -ary trees is closed under .
The involution gives rise to the involution on -Tamari intervals
which exchanges length-zero intervals and upper intervals. We remark that is different from the involution constructed by Pons since sends length-zero intervals to length-zero ones [18 (5.36)].
The last page after the bibliography illustrates Theorem 2.5 for , where 2-ballot paths are represented by left 2-leafy caterpillars.
Enumeration of -leafy trees
The bijection already implies the closed-form expression
as equals the same expression (1).
Trees are among typical combinatorial objects that can be constructed recursively based on disjoint union and concatenation. This feature makes it possible to write down functional equations of their generating series. We present two functional equations involving generating series of -leafy trees. The first already appeared in the enumeration of -Tamari intervals [5]. The second appears to be new and can be solved following general methods developed in [6]; see also [4].
First functional equation
For a tree , let (resp. ) be the number of internal vertices in the longest chain obtained by taking only the leftmost (resp. rightmost) child starting from the root. For a single leaf, . Consider the generating function
Proposition 3.3. Writing , we have
where is the divided difference operator .
The equation (7) is precisely [5 (3)], although interpreted in terms of -Tamari intervals using the initial rise of upper path and the contact of lower path. We remark that via the bijection , the initial rise translates to our whereas the contact does not translate to our . In fact, the quantity is the number of north steps shared by the -ballot paths and , while is the number of initial north steps of .
The tree interpretation makes the following symmetry (described as a combinatorial mystery for rise-contact in [5]) evident, since the mirror map exchanges the statistics and :
Second functional equation
While the solution to (7) in [5] is rather complex, we present another functional equation with a catalytic parameter whose solution is simpler. Define the generating series
where the sum is over all forests whose component trees are -leafy, and and are extended from trees to forests additively.
Write and for , where . For example, , which counts the forest of isolated leaves; is the generating series of the family .
Proposition 3.7. The series and , satisfy the functional equation
Note that (10) determines and all at once. Solving for following the general methods in [6] leads to the closed formula (5) of .
Bijection to central tight gradings
While leafy trees are a new combinatorial object to our knowledge, they arose naturally in the study of tight gradings recently introduced by the authors to investigate rank-2 scattering diagrams [8]. In this section, we construct an explicit bijection between leafy trees and certain tight gradings. We begin by providing preliminaries on the relevant tight gradings, which are those corresponding to the central wall-coefficients of rank-2 skew-symmetric cluster scattering diagrams. Cluster algebras and their associated cluster scattering diagrams have an incredibly rich theory with numerous connections across mathematics and physics which we do not describe here; we instead refer the reader to [13, 14, 17] for further details.
Central tight gradings
We now give an explicit description of the tight gradings corresponding to the central wall coefficient of the cluster scattering diagram . Tight gradings are defined much more generally in [7], and a tiling description is given in [9 Section 5].
For , let be the -path . This path is sometimes referred to as the maximal Dyck path inside the rectangle of length and height . Given a subset of steps (also known as edges) in an -path , we denote the set of east (resp. north) steps by (resp. ) and the total number of steps by .
A grading on an -path is an assignment of a nonnegative integer to each edge of the path. Given a grading and a set of edges , we set . For edges and , let be the subpath proceeding east from the left endpoint of to the top endpoint of , continuing cyclically around if necessary.
Definition 4.1. Fix an -path and a grading . For each edge in , we define its shadow, denoted by or , as follows.
If , then its shadow is , where is chosen such that and has minimal length under this condition. If no such exists, let .
If , then its shadow is , where is chosen such that and has minimal length under this condition. If no such exists, let .
For , let the shadow of be .
Definition 4.2. A grading is compatible if for any edges and , either or .
Compatible gradings (or compatible pairs) originated in the work of Lee-Li-Zelevinsky in their construction of the greedy basis [16].
Definition 4.3. A central tight grading of order is a compatible grading on such that there are horizontal and vertical edges having value in the grading, and all other edges have value in the grading. We denote the set of all such tight gradings by .
The following result is a special case of [8 Theorem 2.3].
Theorem 4.4. The central wall-function in is given by
Pictorially, we represent gradings by drawing a stack of height consisting of blue rectangular tiles above each , and a row of length consisting of red rectangular tiles to the left of each . Given a path where is some -word, we define the rotation operation which takes to be the -path . A rotation of is any path of the form for . For the pictorial representation of a grading, it is sometimes useful to instead work on a rotation of the underlying -path.
For each central tight grading on , there is a unique choice of such that all tiles in the pictorial representation of the grading are contained in the rectangle bounding the rotated path [9], Remark 5.2. In this case, we say that is -framed.
Remark 4.5. The compatibility condition on tight gradings implies that in this pictorial representation, the red and blue tiles do not overlap when drawn on any rotation of the underlying Dyck path.
Bijection between tight gradings and vertex-pointed leafy trees
A tree is vertex-pointed if it is equipped with a distinguished choice of vertex, denoted by . Let denote the set of vertex-pointed -leafy trees on internal vertices and leaves. Note that .
Fix . For each internal vertex , add an auxiliary vertex to be the rightmost child of . This yields a new tree , which is an -leafy tree with leaves and internal vertices. Note that the distinguished vertex in can be any vertex except the auxiliary vertices.
Label all vertices of according to the left-to-right preorder, denoting the label of a vertex by and starting with label 0 at the root. We will work on the rotated path , where .
For each horizontal (resp. vertical) edge of , label it by (resp. ) where is the number of horizontal edges to its left in . Let denote the set of horizontal edges with nonzero value in the grading , and analogously for .
Theorem 4.6. There is an explicit bijection
defined as follows. Given a vertex-pointed leafy tree with denoting the label of each vertex , the corresponding tight grading on is defined by
, and
.
Remark 4.8. The inverse map to can be readily constructed as follows. Looking each horizontal edge , create a word on the 3-letter alphabet as follows:
The leafy tree is the plane tree associated to , and is the vertex corresponding to the unique horizontal edge that is followed by another horizontal edge.
Bijection between 0-framed tight gradings and leafy trees
In order to construct a bijection involving leafy trees rather than the vertex-pointed leafy trees, we refine the tight gradings by their frame. Let denote the subset of tight gradings in that are -framed.
Note that the set of leafy trees in is naturally identified with the subset of where the distinguished vertex is the root, in which case we say the tree is root-pointed. Equivalently, the root-pointed leafy trees in are those where . Thus under the map , the subset of root-pointed leafy trees in corresponds precisely to .
These identifications together yield a direct bijection from leafy trees to 0-framed tight gradings.
Example 4.11. Let be the 2-leafy tree at the left of Figure 7 (without a distinguished vertex). Then the corresponding tight grading is depicted on the left of Figure 6.

Figure 6. A 0-framed central tight grading (left) and a 7-framed central tight grading (right) where and . Note that edges of the underlying -path that are directly below a blue tile or to the right of a red tile are precisely the edges with value in the tight grading, and all other edges take value 0.

Figure 7. For a vertex-pointed 1-leafy tree (left), we depict the tree (middle) where is circled in each. On the right, we have the corresponding tight grading , where and . Note that the tight grading is 7-framed, where 7 is the label of the distinguished vertex in .
Acknowledgements
The authors are grateful to Hyun Kyu Kim and Korea Institute for Advanced Study, where several key ideas were developed when AB and LM visited KL in June 2026. The authors also thank François Bergeron, Mireille Bousquet-Mélou, Frédéric Chapoton, Éric Fusy, Vincent Pilaud, Markus Reineke, and Hugh Thomas for helpful discussions and comments. AB was partially supported by NSF grant DMS-2503411.
AI disclosure. The authors formulated the definition of leafy trees, inspired by their study of tight gradings, without AI assistance. After this, the only notable mathematical AI contribution came from querying GPT-5.6 in July 2026 for ways to associate a Dyck path to a 1-leafy tree. Among the suggestions were the constructions we later generalized to define the bijection . The proofs (to be presented in a later full version of this article) were discovered without AI assistance. AI was used elsewhere in reviewing exposition, performing literature searches, doing numerical experiments, and generating figures.
References
Amanda Burcroff, Department of Mathematics, MIT, Cambridge, MA 02139, USA
Email address: [email protected]
Kyungyong Lee, Department of Mathematics, University of Alabama, Tuscaloosa, AL 35487, USA and Korea Institute for Advanced Study, Seoul 02455, Republic of Korea
Email address: [email protected] & [email protected]
Lang Mou, Department of Mathematics, University of California Davis, Davis, CA 95616, USA
Email address: [email protected]
Figure 1 (PDF p. 13). The 2-Tamari lattice . The remaining 30 intervals, grouped by length. . The intervals are grouped under , , , , and .
References
- [1]Alexandre Astruc, Frédéric Chapoton, Karen Martinez, and Markus Reineke, Motives of central slope Kronecker moduli, Épijournal Géom. Algébrique 9 (2025), Art. 19, 15.DOI
- [2]François Bergeron and Louis-François Préville-Ratelle, Higher trivariate diagonal harmonics via generalized Tamari posets, J. Comb. 3 (2012), no. 3, 317–341.arxiv.org/abs/1105.3738
- [3]Olivier Bernardi and Nicolas Bonichon, Intervals in Catalan lattices and realizers of triangulations, J. Combin. Theory Ser. A 116 (2009), no. 1, 55–75.DOI
- [4]Mireille Bousquet-Mélou, Rational and algebraic series in combinatorial enumeration, International Congress of Mathematicians. Vol. III, Eur. Math. Soc., Zürich, 2006, pp. 789–826.
- [5]Mireille Bousquet-Mélou, Éric Fusy, and Louis-François Préville-Ratelle, The number of intervals in the m-Tamari lattices, Electron. J. Combin. 18 (2011), no. 2, Paper 31, 26.
- [6]Mireille Bousquet-Mélou and Arnaud Jehanne, Polynomial equations with one catalytic variable, algebraic series and map enumeration, J. Combin. Theory Ser. B 96 (2006), no. 5, 623–672.
- [7]Amanda Burcroff, Kyungyong Lee, and Lang Mou, Positivity of generalized cluster scattering diagrams, arXiv preprint 2503.03719, 2025.arxiv.org/abs/2503.03719
- [8]————, Scattering diagrams, tight gradings, and generalized positivity, Proc. Natl. Acad. Sci. USA 122 (2025), no. 18, e2422893122.DOI
- [9]Amanda Burcroff, Kyungyong Lee, Lang Mou, Gregg Musiker, and Markus Reineke, Cluster scattering diagrams via quiver moduli and tight gradings, J. Lond. Math. Soc. (2) 114 (2026), no. 2, Paper No. e70642.arxiv.org/abs/2511.14672
- [10]F. Chapoton, Sur le nombre d’intervalles dans les treillis de Tamari, Sém. Lothar. Combin. 55 (2005/07), Art. B55f, 18.
- [11]Grégory Châtel and Viviane Pons, Counting smaller elements in the Tamari and m-Tamari lattices, J. Combin. Theory Ser. A 134 (2015), 58–97.
- [12]Wenjie Fang, Éric Fusy, and Philippe Nadeau, Tamari intervals and blossoming trees, Comb. Theory 5 (2025), no. 1, Paper No. 4, 41.DOI
- [13]Sergey Fomin, Lauren Williams, and Andrei Zelevinsky, Introduction to cluster algebras. Chapters 1–3, arXiv preprint 1608.05735, 2016.arxiv.org/abs/1608.05735
- [14]Mark Gross, Paul Hacking, Sean Keel, and Maxim Kontsevich, Canonical bases for cluster algebras, J. Amer. Math. Soc. 31 (2018), no. 2, 497–608.
- [15]Mark Gross and Rahul Pandharipande, Quivers, curves, and the tropical vertex, Port. Math. 67 (2010), no. 2, 211–259.arxiv.org/abs/0909.5153
- [16]Kyungyong Lee, Li Li, and Andrei Zelevinsky, Greedy elements in rank 2 cluster algebras, Selecta Math. (N.S.) 20 (2014), no. 1, 57–82.
- [17]Tomoki Nakanishi, Cluster algebras and scattering diagrams, MSJ Memoirs, vol. 41, Mathematical Society of Japan, Tokyo, 2023.DOI
- [18]Viviane Pons, The rise-contact involution on Tamari intervals, Electron. J. Combin. 26 (2019), no. 2, Paper No. 2.32, 53.arxiv.org/abs/1802.08335
- [19]Markus Reineke, Cohomology of quiver moduli, functional equations, and integrality of Donaldson-Thomas type invariants, Compos. Math. 147 (2011), no. 3, 943–964.DOI
- [20]Markus Reineke and Thorsten Weist, Refined GW/Kronecker correspondence, Math. Ann. 355 (2013), no. 1, 17–56.
- [21]Thorsten Weist, Localization in quiver moduli spaces, Represent. Theory 17 (2013), 382–425.arxiv.org/abs/0903.5442

