Cesar Ceballos

AND Wenjie Fang
email: wenjie.fang@u-pem.fr

Henri Mühle
email: henri.muehle@tu-dresden.de

Henri M Ühle

The Steep-Bounce zeta map in Parabolic Cataland

Keywords: parabolic Tamari lattice, ν-Tamari lattice, bijection, left-aligned colorable tree, zeta map

de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Introduction Part 1. Parabolic Cataland

INTRODUCTION

The Tamari lattice can be realized as a partial order on various Catalan objects. It has been studied widely from various perspectives, leading to numerous generalizations. Two of its recent variants are the parabolic Tamari lattices of Williams and the third author [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF] and the ν-Tamari lattices of Préville-Ratelle and Viennot [START_REF] ¸ois Préville-Ratelle | The enumeration of generalized Tamari intervals[END_REF]. The parabolic Tamari lattices are defined as certain lattice quotients of the weak order in parabolic quotients of the symmetric group, which generalizes a construction by Bj örner and Wachs [START_REF] Bj | Shellable and nonpure complexes and posets II[END_REF]. The ν-Tamari lattices are, in contrast, partial orders defined by manipulating lattice paths. They generalize the m-Tamari lattices which were initially motivated by connections to trivariate diagonal harmonics [START_REF] Franc ¸ois Bergeron | Higher trivariate diagonal harmonics via generalized Tamari posets[END_REF], and now have remarkable applications to the theory of multivariate diagonal harmonics [START_REF] Bergeron | Hopf Dreams and Diagonal Harmonics[END_REF] and bijective links to other objects in combinatorics [START_REF] Fang | The enumeration of generalized Tamari intervals[END_REF].

In this article, we reunite the objects in these two variants of the Tamari lattice. More precisely, we introduce a new family of parabolic Catalan objects which we call left-aligned colorable trees (or simply LAC trees). These trees connect the parabolic generalizations of 231-avoiding permutations, noncrossing set partitions, and Dyck paths introduced in [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF], all of which can be recovered easily from the tree. We have the following result, with precise definitions delayed to subsequent sections.

Theorem I. For every integer composition α, there is an explicit bijection from the set T α of α-trees to each of the following: the set S α (231) of (α, 231)-avoiding permutations, the set NC α of noncrossing α-partitions, and the set D α of α-Dyck paths.

We continue with a structural study of the two variants of the Tamari lattice.

With each composition α one can associate a bounce path ν α , and we show that the corresponding ν α -Tamari lattice T ν α and the parabolic Tamari lattice T α are isomorphic. This result is particularly interesting because these two lattices provide completely different perspectives. By definition of T ν α , it is simple to check when two elements form a cover relation, but in general it is not easy to check whether they are comparable. In T α , the situation is quite the opposite: by definition it is easy to check when two elements are comparable, but to determine whether they form a cover relation is a nontrivial task.

We exploit the fact that T α and T ν α are extremal lattices, and can therefore be uniquely represented by certain directed graphs. We show that the bijection between parabolic 231-avoiding permutations and parabolic Dyck paths from [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF] extends to an isomorphism of these graphs, and we may therefore conclude the following result.

Theorem II. For every integer composition α, the parabolic Tamari lattice T α is isomorphic to the ν α -Tamari lattice T ν α .

In Part 3, we use LAC trees to prove the Steep-Bounce Conjecture of Bergeron, Ceballos, and Pilaud [5, Conjecture 2.2.8], which connects the graded dimensions of a certain Hopf algebra of pipe dreams to the enumeration of certain family of lattice walks in the positive quarter plane. Our proof is based on a bijection Γ between two families of nested Dyck paths via LAC trees.

Theorem III (The Steep-Bounce Theorem). For n > 0 and every r ∈ [n], the map Γ is a bijection from

• the set of nested pairs (µ 1 , µ 2 ) of Dyck paths with 2n steps, where µ 2 is a steep path ending with exactly r east-steps with y-coordinate equal to n, to • the set of nested pairs (µ 1 , µ 2 ) of Dyck paths with 2n steps, where µ 1 is a bounce path that touches the main diagonal r + 1 times.

Interestingly, we show that the bijection Γ generalizes the famous zeta map in q, t-Catalan combinatorics. Given a Dyck path µ, we use two different greedy algorithms to define its associated steep path µ steep and its bounce path µ bounce . Details are delayed to related sections. With these notions, we have the following result.

Theorem IV. For n > 0, the map Γ restricts to a bijection from

• the set of pairs (µ, µ steep ), where µ is a Dyck path with 2n steps, to

• the set of pairs (ν bounce , ν), where ν is a Dyck path with 2n steps. Moreover, if (ν bounce , ν) = Γ(µ, µ steep ), then ν = ζ(µ), where ζ is the zeta map from q, t-Catalan combinatorics.

The study of q, t-Catalan combinatorics originated over twenty years ago in connection to Macdonald polynomials and Garsia-Haiman's theory of diagonal harmonics [START_REF] Adriano | A proof of the q,t-Catalan positivity conjecture[END_REF][START_REF] Adriano | A remarkable q, t-Catalan sequence and q-Lagrange inversion[END_REF][START_REF] Haglund | Conjectured statistics for the q, t-Catalan numbers[END_REF][START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF][START_REF] Haiman | Vanishing theorems and character formulas for the Hilbert scheme of points in the plane[END_REF]. The q, t-Catalan polynomial can be obtained as the bigraded Hilbert series of the alternating component of certain module of diagonal harmonics, whose dimension is equal to the Catalan number [START_REF] Haiman | Vanishing theorems and character formulas for the Hilbert scheme of points in the plane[END_REF]. The zeta map is a bijection on Dyck paths that explains the equivalence of two combinatorial interpretations of these polynomials [START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF], which were discovered almost simultaneously by Haglund and Haiman in terms of two pairs of statistics on Dyck paths.

The zeta map was further generalized by Haglund and Loehr [START_REF] Haglund | A conjectured combinatorial formula for the Hilbert series for diagonal harmonics[END_REF], who introduced an extension from the set of parking functions to certain diagonally labeled Dyck paths. As in the q, t-Catalan case, their extension explains the equivalence of two combinatorial interpretations of the Hilbert series of the full diagonal harmonics module [START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF]Chapter 5] [START_REF] Carlsson | A proof of the shuffle conjecture[END_REF], whose dimension is equal to the number of parking functions [START_REF] Haiman | Vanishing theorems and character formulas for the Hilbert scheme of points in the plane[END_REF]. In Corollary 3.22, we show that this generalized zeta map can be obtained as a labeled version of our bijection Γ.

The organization of this article is as follows. In the first part, we introduce several families of parabolic Catalan objects, including left-aligned colorable trees, and then describe bijections between these families. In the second part, we dive into the order structure of parabolic Tamari lattices to explain how they are isomorphic to certain ν-Tamari lattices. In the third part, we demonstrate how our bijection Γ settles the Steep-Bounce Conjecture while generalizing the zeta map in q, t-Catalan combinatorics, and present a labeled version which gives rise to the extension of the zeta map from parking functions to diagonally labeled Dyck paths.

Part 1. Parabolic Cataland

In the first part of this article, we present an overview of the currently explored parts of Parabolic Cataland. The name "Cataland" was coined in [36], and describes the interaction of the various tribes of Catalan families associated with finite Coxeter groups 1 .

Recently, the frontiers of Cataland were pushed back in two different directions. Firstly, in [START_REF] Stump | Cataland: Why the Fuß?[END_REF], a positive integral parameter m was introduced, which yields Fuß-Catalan families associated with finite Coxeter groups. These families live in "Fuß-Cataland". Secondly, in [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF] (building on [36]), the various Catalan families were generalized to parabolic quotients of finite Coxeter groups. These generalizations constitute "Parabolic Cataland", of which only the type A case is reasonably well understood. In this section, we explore these parabolic Catalan families and their web of connections.

MEMBERS OF PARABOLIC CATALAND

We now introduce the main protagonists of this story, but we first fix some notation.

For a natural number n > 0, let [n] def = {1, 2, . . . , n}, and let α = (α 1 , α 2 , . . . , α r ) be a composition of n. Moreover, let α def = (α r , α r-1 , . . . , α 1 ), and |α|

= α 1 + α 2 + • • • + α r .
For i ∈ {0, 1, . . . , r}, we define s i def

= α 1 + α 2 + • • • + α i and t i def = n -s r-i
, where we consider s 0 = 0. For i ∈ [r] the set {s i-1 + 1, s i-1 + 2, . . . , s i } is the i-th α-region.

1.1.1. Parabolic 231-Avoiding Permutations. Let S n be the symmetric group of degree n. The parabolic quotient of S n with respect to α is defined by

S α def = w ∈ S |α| | w(k) < w(k + 1) for k /
∈ {s 1 , s 2 , . . . , s r-1 } .

Definition 1.1 [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF]Definition 3.2]). In a permutation w ∈ S α , an (α, 231)-pattern is a triple of indices i < j < k each in different α-regions such that w(k) < w(i) < w(j) and w(i) = w(k) + 1. A permutation in S α without (α, 231)-patterns is (α, 231)-avoiding.

A pair of indices (i, k) such that w(i) = w(k) + 1 is a descent of w. We denote the set of all (α, 231)-avoiding permutations of S α by S α (231). An example is shown in the top-left corner of Figure 1. In this article, a permutation w is always presented in its one-line notation w(1)w(2) • • • w(n).

If α = (1, 1, . . . , 1), then we obtain precisely the stack-sortable permutations introduced in [21, Exercise 2.2.1.4].

1.1.2. Parabolic Noncrossing Partitions. For |α| = n, an α-partition is a set partition of [n] where every block intersects an α-region in at most one element. Let Π α denote the set of all α-partitions. A bump of P ∈ Π α is a pair of consecutive elements in some block of P, or more precisely, a pair (a, b) such that a and b belong to the same block of P, and there exists no c ∈ [n] with a < c < b such that a and c belong to the same block of P. Definition 1.2 [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF]Definition 4.1]). An α-partition P ∈ Π α is noncrossing if it satisfies the following two conditions.

(NC1): If two distinct bumps (a 1 , b 1 ) and (a 2 , b 2 ) of P satisfy a 1 < a 2 < b 1 < b 2 , then either a 1 and a 2 belong to the same α-region, or b 1 and a 2 belong to the same α-region. (NC2): If two distinct bumps (a 1 , b 1 ) and (a 2 , b 2 ) of P satisfy a 1 < a 2 < b 2 < b 1 , then a 1 and a 2 belong to different α-regions.

Let us denote the set of all noncrossing α-partitions by NC α . We represent αpartitions graphically by its diagram as follows. First of all, we draw n vertices on a horizontal line, label them from 1 through n, and group them by α-regions. For P ∈ Π α we represent a bump (a, b) of P by a curve that leaves the a-th vertex to the bottom, stays below all vertices in the same α-region as a, then moves up and continues above every vertex in the subsequent α-regions, until it reaches the b-th vertex, which it enters from the top. Throughout this article we say "elements of P" instead of "vertices of the diagram of P".

We can verify that an α-partition is noncrossing if and only if it admits a diagram in which no two curves cross.

An example for α = (1, 3, 1, 2, 4, 3) is the noncrossing α-partition {1, 3}, {2, 6}, {4, 9, 12}, {5}, {7, 8}, {10, 14}, {11}, {13} , whose diagram is shown in the top-central part of Figure 1.

If α = (1, 1, . . . , 1), then we obtain precisely the noncrossing set partitions studied in [START_REF] Kreweras | Sur les partitions non croisées d'un cycle[END_REF].

Let P ∈ NC α . The unique block of P containing 1 is the first block of P, and we usually denote it by P • .

If i is an element of P, and (a, b) a bump of P with a < i ≤ b such that a and i belong to different α-regions, then we say that i lies below (a, b). Moreover, another bump (a , b ) of P separates i from (a, b) if i lies below (a , b ) and either a < a with a, a in the same α-region, or a < a for a, a in different α-regions. In the diagram, it means that the bump (a , b ) is between i and (a, b). Finally, i lies directly below (a, b) if either b = i or i is not separated from (a, b) by any other bump of P.

For P, P ∈ P we say that P starts below P if min P lies below some bump of P. = (0, 1) (so-called north steps), ending on the main diagonal while staying always weakly above it. A Dyck path can be regarded as a word in the alphabet {N, E}. For a Dyck path ν, we derive the path ν by reversing ν and exchanging east and north steps.

A valley on a Dyck path is a lattice point p that is preceded by an east-step and followed by a north-step. Similarly, a peak is a lattice point p that is preceded by a north-step and followed by an east-step.

A Dyck path is steep if it does not have consecutive east-steps before the last north step. A Dyck path is bounce if it is of the form N i 1 E i 1 N i 2 E i 2 . . . N i s E i s , for some strictly positive integers i 1 , i 2 , . . . , i s (because it "bounces off" the main diagonal s -1 times).

The α-bounce path is ν α

def = N α 1 E α 1 N α 2 E α 2 . . . N α r E α r .
In particular, we have ν α = ν α . Definition 1.3. Any Dyck path with 2|α| steps that stays weakly above ν α is an α-Dyck path.

We denote the set of all α-Dyck paths by D α . An example is shown on the left of Figure 1.

If α = (1, 1, . . . , 1), then we obtain the well-studied Dyck paths. See for instance [START_REF] Deutsch | Dyck path enumeration[END_REF] for an enumerative study of these paths.

1.1.4. Left-Aligned Colorable Trees. In this section we introduce a new family of combinatorial objects that are naturally parametrized by an integer n and some composition α of n. In Section 1.2 we show that these objects are in bijection with each the previously mentioned parabolic Catalan objects.

Let T be a plane rooted tree with vertex set V, whose root is denoted by v • . Throughout this article we refer to the vertices of a tree as nodes.

A partial coloring of T is a map

C : V → N for some V ⊆ V \ {v • }. If V = V \ {v • }, then C is a full coloring.
A colored tree is a pair (T, C), where T is a plane rooted tree, and C is a full coloring of T. We refer to the elements in the image of C as C-colors.

A node v ∈ V \ {v • } is active with respect to a partial coloring C on V ⊆ V if v /
∈ V and its parent belongs to V ∪ {v • }.

Recall that the left-to-right traversal of a plane rooted tree T is a depth-first search in T starting from the root, where children of the same node are visited from left to right. The LR-prefix order (resp. LR-postfix order) of T is the linearization of the nodes of T, where we record the nodes in order of first (resp. last) visits in left-toright traversal.

Construction 1.4. Let n > 0 and let α = (α 1 , α 2 , . . . , α r ) be a composition of n. Let T be a plane rooted tree with n non-root nodes.

We initialize our algorithm by T 0 = (T, C 0 ), with C 0 the empty coloring. In the k-th step, we denote by A k the set of active nodes of T with respect to the partial coloring C k-1 . If |A k | < α k , then the algorithm fails. Otherwise, we let F k be the set of the first α k elements of A k in the LR-prefix order of T, and we set

V k = V k-1 F k . (Here denotes disjoint set union.) We define a partial coloring C k : V k → N by C k (v) = C k-1 (v), if v ∈ V k-1 , k, if v ∈ F k ,
and we set T k = (T, C k ).

If the algorithm has not failed after r steps, then we return the colored tree T r = (T, C r ).

Every plane rooted tree for which Construction 1.4 does not fail is compatible with α; the corresponding coloring is a left-aligned coloring. It is clear that every plane rooted tree has at most one left-aligned coloring with respect to α. Definition 1.5. Any plane rooted tree with |α| non-root nodes that is compatible with α is an α-tree.

We denote the set of all α-trees by T α . An example is shown in the middle of Figure 1. We remark that every plane rooted tree is compatible with α = (1, 1, . . . , 1). Moreover, if we fix a plane rooted tree T, and consider α T = (α 1 , α 2 , . . .), where α i equals the number of nodes of T whose distance to the root is exactly i, then T is compatible with α T . (In every step of Construction 1.4 we simply color all active nodes.) This composition will play an important role in the last part of this article.

We say that two nodes in a rooted tree are comparable if one is an ancestor of the other. Otherwise, the two nodes are incomparable. Lemma 1.6. Every α-tree has the following properties.

(i) The color of every node is smaller than the color of its children, and nodes of the same color are incomparable. (ii) The active nodes of each step of the construction will eventually receive colors that are weakly increasing in LR-prefix order.

Proof. The first point follows from the fact that a node becomes active before its children do. The second point follows from the construction of coloring where active nodes are selected for coloring in LR-prefix order, starting always from the first active node.

3 1 2 3 1 2 3 2 1 2 1 3 2 1 3 2 3 1 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3

BIJECTIONS IN PARABOLIC CATALAND

In this section we describe explicit bijections between the parabolic Catalan objects introduced in Section 1.1. The bijections in the two following subsections 1.2.1 and 1.2.2 are reproduced from [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF], the bijections of the remaining subsections 1.2.3, 1.2.4 and 1.2.5 are new. Figure 2 shows the various parabolic Catalan families for the compositions of 3.

Noncrossing Partitions and Dyck Paths.

The following construction associates a noncrossing α-partition with each α-Dyck path. Construction 1.7. Let α = (α 1 , α 2 , . . . , α r ) be an integer composition. Let µ ∈ D α , whose valleys are (p 1 , q 1 ), (p 2 , q 2 ), . . . , (p m , q m ) with p 1 < p 2 < • • • < p m . We set p 0 = 0.

We initialize our algorithm with the α-partition P 0 without any bumps. In the ith step, we construct the α-partition P i from P i-1 by adding a bump corresponding to the valley (p i , q i ). To do so, we pick the unique index 0 ≤ k < r such that t k ≤ q i ≤ t k+1 , so that we can write q i = t k + for some ∈ {0, 1, . . . , t k+1t k }.

We then obtain P i by adding the bump (a, b) to P i-1 , where a is the ( + 1)-st element in the (rk)-th α-region and b is the (p ip i-1 )-th element after the (rk)-th α-region that is not already below some bump.

After m steps we return the α-partition

P µ = P m .
Two examples of this construction are illustrated in the top part of Figure 11.

Theorem 1.8 ([26, Theorem 5.2]). For µ ∈ D α the α-partition P µ is noncrossing. Moreover, the map

(1) Θ 1 : D α → NC α , µ → P µ .
is a bijection that sends valleys to bumps. Proof. This follows from the fact that (P, P ) ∈ R P implies min P < min P .

As a consequence, we may define a partial order O P on the blocks of P by taking the reflexive and transitive closure of R P . By construction the first block of P is a minimal element of the poset P, O P .

Example 1.10. Let α = (1, 3, 1, 2, 4, 3, 1), and consider the noncrossing α-partition

P = {1, 3, 10} = P 1 , {2, 6} = P 2 , {4} = P 3 , {5} = P 4 , {7, 8} = P 5 , {9, 13} = P 6 , {11, 14} = P 7 , {12, 15} = P 8 .
The diagram of P is shown below, with its first block highlighted.

The block P 2 , for instance, starts below P 1 because (1, 3) is a bump and min P 2 = 2. The relation R P is the following: R P = (P 1 , P 2 ), (P 1 , P 4 ), (P 1 , P 5 ), (P 1 , P 6 ), (P 2 , P 4 ), (P 6 , P 8 ), (P 7 , P 8 ) .

The poset diagram of (P, O P is shown below.

{4} {1,

• = {i 1 , i 2 , . . . , i s } with i 1 < i 2 < • • • < i s . (Thus, i 1 = 1.)
We construct a permutation w P recursively such that

w P (i 1 ) = w P (i 2 ) + 1 = • • • = w P (i s ) + s -1,
and w P (i 1 ) is as small as possible. To achieve that, we determine

D = {P ∈ P | (P • , P) ∈ O P },
and we set w P (i 1 ) = |D|. (In other words, D consists of all elements of [n] that belong to a block of P that lies weakly above P • in P, O P .)

Now we break P into two pieces, namely

P 1 = P ∩ D | P ∈ P \ P • \ {∅}, P 2 = P ∩ [n] \ D | P ∈ P \ P • \ {∅}.
We may view P 1 and P 2 as noncrossing partitions with respect to some integers n 1 and n 2 and compositions α 1 of n 1 and α 2 of n 2 , respectively. In particular, n 1 , n 2 < n, so that we may determine the missing values of w P via this recursion. We will have w We label the non-root nodes of T in LR-postfix order. We then group together the labels that correspond to nodes with the same color under C, and order these labels increasingly. Finally, we order the blocks according to their color, and obtain a permutation w T ∈ S α .

P (i) > |D| if i ∈ [n] \ D,
An example of Construction 1.14 is illustrated in Figure 3. Lemma 1.15. For a non-root node u in a plane rooted tree T, the next node v in the LRpostfix order is either its parent, of which u is the last child, or the left-most leaf of the subtree induced by its sibling immediately to the right.

Proof. This follows from the definition of the LR-postfix order. Construction 1.14 suggests the definition of the following map, which we next show is well-defined:

(3)

Ξ perm : T α → S α (231), T → w T .
Proposition 1.16. For an α-tree T, the permutation w T obtained by Construction 1.14 is (α, 231)-avoiding.

Proof. Let T be an α-tree with corresponding left-aligned coloring C. Suppose that (i, j, k) is an (α, 231)-pattern in w T . Let u i , u j , u k denote the nodes of T labeled by i, j, k, respectively, in Construction 1.14. It follows that C(u i ) < C(u j ) < C(u k ).

By Lemma 1.15, since w T (k) + 1 = w T (i), the node u i is either the parent of u k , or the left-most leaf of the subtree induced by the sibling of u k on the right. However, the second case cannot happen, since the node u k would then become active before u i (because u k precedes u i in LR-prefix order). By Lemma 1.6(ii), we would have C(u i ) ≥ C(u k ), which is a contradiction.

Therefore, u i is the parent of u k , which means that u k is active during steps i + 1, i + 2, . . . , k in Construction 1.4, in particular in step j. Since C(u j ) = j < C(u k ), the node u j must come before u k in LR-prefix order. However, since w(i) < w(j), we know that u j comes after u i in LR-postfix order, and C(u i ) < C(u j ) means that u j is not an ancestor of u i . Therefore, u j must come after u i in LR-prefix order, and thus also after u k . This is a contradiction, and we conclude that w T is (α, 231)avoiding.

Let us now describe how to obtain a plane rooted tree from an (α, 231)-avoiding permutation.

Construction 1.17. Let α be an integer composition, and let w ∈ S α (231).

We initialize our algorithm with the tree T 0 that has a single node labeled by |α| + 1. In the i-th step we create the tree T i by inserting a node labeled by w(i) into T i-1 . This insertion proceeds as follows. We start at the root and walk around T i-1 . Suppose that we have reached a node v with label a. If w(i) < a, then we move to the left-most child of v, otherwise we move to the first sibling of v on the right. If the destination does not exist, then we create it and label it by w(i).

After |α| steps we return the plane rooted tree T w = T |α| .

Readers familiar with binary search trees may notice that this construction is essentially the insertion algorithm for binary search trees composed with the classical bijection between binary and plane trees.

It turns out that the output of Construction 1.17 is a plane rooted tree compatible with α, which enables us to define the following map:

(4)

Λ perm : S α (231) → T α , w → T w .

Proposition 1.18. For an (α, 231)-avoiding permutation w, the plane rooted tree T w obtained by Construction 1.17 is compatible with α.

Proof. Let us define a full coloring f of T w as follows. For every node v of T w with label a we set f (v) = i if and only if w -1 (a) belongs to the i-th α-region. It remains to prove that f is the left-aligned coloring of T w produced in Construction 1.4.

(Because in that case, Construction 1.4 does not fail, and T w is indeed an α-tree.) Construction 1.17 implies that the nodes of T w are labeled in LR-postfix order. Now we show that for every non-root node u of T w whose parent v is not the root, we have f (u) > f (v). Since v is the parent of u, it is inserted before u, which yields

f (u) ≥ f (v). If f (u) = f (v)
, then the labels of u and v must come from indices in the same α-region. However, by construction, the label of u is smaller than that of v, which would produce an inversion in their common α-region, contradicting the assumption that w ∈ S α . We conclude that nodes of T w labeled by elements coming from the same α-region are incomparable. Now let α = (α 1 , α 2 , . . . , α r ). We now prove that T w is an α-tree, and f is its left-aligned coloring. We consider the partial colorings C s obtained after step s of Construction 1.4, and proceed by induction to prove that, for all 0 ≤ s ≤ r, the algorithm does not fail in step s, and C s is the same as the restriction f s of f to values from 1 to s. The base case s = 0 is clearly correct. Now suppose that the induction hypothesis holds for s -1.

We first show that there are always enough active nodes for step s. Since w ∈ S α (231), labels w(i) for i in the s-th α-region are inserted in increasing order, and by Construction 1.17, these newly inserted nodes cannot be comparable. Therefore, they are all children of nodes in the domain of C s-1 , thus active at step s. We therefore have at least α s active nodes, and C s is well defined.

We now show that C s coincides with f s . Suppose otherwise, and let u * be the first node of T w in LR-prefix order that is in the domain of C s but not in that of f s . We have f (u * ) > s. Let u i be the parent of u * , which is in the domain of C s-1 , and therefore in that of f s-1 by induction hypothesis. We thus have f (u i ) ≤ s -1.

By minimality of u * , the node u i is in the domain of C s . Let u k be the rightmost child of u i (which exists as u i has a least one child u * ). Since u k is inserted after u * , we conclude that f (u k ) ≥ f (u * ). It is clear that the domains of C s and of f s are of the same size. Hence, there is a node u j in the domain of f s but not in that of C s , and we take it the minimal in LR-prefix order.

By induction hypothesis, we have f (u j ) ≥ s, thus f (u j ) = s. Since nodes are colored in LR-prefix order in Construction 1.17, u * is also the first node that differs in the domains of C s and f s , meaning that u * precedes u j in LR-prefix order. If u j is a child of u i , since f (u * ) > s = f (u j ), it would lead to a contradiction to Construction 1.17. Therefore, u j comes after u i in LR-postfix order.

Let i, j, k be the indices such that u i , u j , u k are labeled by w(i), w(j), w(k) respectively. Since f (u i ) < f (u j ) = s < f (u k ), we have i < j < k. Moreover, by construction, since u k is the rightmost child of u i , we have w(k) + 1 = w(i), and since u j comes after u i in LR-postfix order, we have w(j) > w(i). Therefore, (i, j, k) is an (α, 231)-pattern in w, which is a contradiction.

We thus conclude the induction, meaning that f is the left-aligned coloring of T w , which is therefore an α-tree.

We conclude this section with the proof that Ξ perm is a bijection with inverse Λ perm . In a plane rooted tree, an internal node is a node that is neither the root nor a leaf. Theorem 1.19. For every integer composition α, the map Ξ perm is a bijection whose inverse is Λ perm . Moreover, Ξ perm sends internal nodes to descents.

Proof. Given Propositions 1.16 and 1.18, it remains to prove that Ξ perm • Λ perm = id and Λ perm • Ξ perm = id. Let α = (α 1 , α 2 , . . . , α r ).

To show that Ξ perm • Λ perm = id, for w ∈ S α (231), we consider T = Λ perm (w) and w = Ξ perm (T). Let C be the full coloring of T constructed in the proof of Proposition 1.16. We have seen in that proof that C is precisely the left-aligned coloring of T from Construction 1.4. Therefore, entries in each α-region of w and w agree, and since there is a unique way to order a set of distinct integers increasingly, we conclude that w = w . Now for Λ perm • Ξ perm = id, given T ∈ T α , we consider w = Ξ perm (T) and T = Λ perm (w). Let C, C be the left-aligned colorings of T and T , respectively, and for s ∈ [r] let T s and T s denote the induced subtrees consisting of the nodes of color at most s in T and T respectively. We prove by induction on s that T s = T s holds for all 0 ≤ s ≤ r.

The base case s = 0 is clear, as T 0 and T 0 consist only of the root. Now suppose that T s-1 = T s-1 . Let u be a node of T with C(u) = s and label w(i), and let u be the node of T with the same label. Since elements in any α-region are ordered increasingly, we know that every node of color s inserted in T before u has a smaller label than u , and by construction no such node can be the parent of u . It follows that the parent v of u belongs to T s-1 . By our induction hypothesis, it follows that the parent v of u in T has the same label as v . Now, for the order of newly inserted children of a node, by Construction 1.17, in T the children of every node at each step are ordered by increasing labels, which is the same as in T due to the LR-postfix order. We thus have T s = T s , which completes the induction step. We conclude that T = T r = T r = T .

Noncrossing Partitions and Left-Aligned Colorable Trees. The next construction associates an α-partition with every α-tree.

Construction 1.20. Let α be an integer composition. Let T ∈ T α whose left-aligned coloring produced by Construction 1.4 is C. We write the |α| non-root nodes of T on a horizontal line, where we group them by their color under C. Each group is then sorted by LR-prefix order, while groups are sorted by increasing color. We then connect two nodes u and v by a bump if and only if v is the rightmost child of u. The diagram thus obtained is the flattening of T.

By Lemma 1.6(i) there are no bumps between elements in the same color group, which implies that the flattening of T is the diagram of some α-partition P T .

See Figure 4 for an illustration of Construction 1.20. We now prove that every α-partition obtained by Construction 1.20 is in fact noncrossing, which allows us to define the following map:

Ξ nc
(5)

Ξ nc : T α → NC α , T → P T .
Proposition 1.21. For an α-tree T, the α-partition P T obtained by Construction 1.20 is noncrossing.

Proof. We recall that by Lemma 1.6(i), nodes with the same color in T are incomparable. Thus, P T is indeed an α-partition. Now suppose that P T is not noncrossing.

There are thus two bumps (a

1 , b 1 ), (a 2 , b 2 ) that violate either (NC1) or (NC2). Let u 1 , v 1 , u 2 , v 2 be the nodes of T corresponding to the elements a 1 , b 1 , a 2 , b 2 , whose colors in the left-aligned coloring of T are c 1 , d 1 , c 2 , d 2 .
If the two bumps violate (NC1), then

a 1 < a 2 < b 1 < b 2 , but a 1 , a 2 , b 1 belong to three different α-regions. It follows that c 1 < c 2 < d 1 .
We conclude that u 2 precedes v 1 in LR-prefix order, since v 1 becomes active immediately after step c 1 of Construction 1.4 in which its parent u 1 receives its color. Moreover, since c 1 < c 2 , the node u 2 is not an ancestor of u 1 . Consequently, the right-most child of u 2 , which is v 2 , precedes v 1 in LR-prefix order, too. However, since b 1 < b 2 , we have d 1 ≤ d 2 , which implies that v 1 precedes v 2 in LR-prefix order. This is a contradiction, and we conclude that (NC1) is not violated.

If the two bumps violate (NC2), then a 1 < a 2 < b 2 < b 1 , and a 1 , a 2 are in the same α-region. It follows that c 1 = c 2 , and from Lemma 1.6(i) we know that u 1 and u 2 are incomparable in T. By Construction 1.20, the node u 1 thus precedes u 2 in LR-prefix order. Since v 1 is the rightmost child of u 1 , it also precedes u 2 in LR-prefix order. Since v 2 is the rightmost child of u 2 , it is also preceded by v 1 in the LR-prefix order. However, since b 2 < b 1 , we have d 2 ≤ d 1 , which implies that v 2 precedes v 1 in LR-prefix order. This is a contradiction, and we conclude that (NC2) is not violated, either.

Hence, P T must be noncrossing.

Let us now describe how to obtain a plane rooted tree from a noncrossing αpartition.

Construction 1.22. For α a composition of n, let P be a noncrossing α-partition, and we label the elements of P by 1, 2, . . . , n from left to right.

We start with a collection of n + 1 nodes v 0 , v 1 , . . . , v n . If the element i does not lie below any bump of P, then we add an edge from v 0 to v i , making v i a child of v 0 . If i lies directly below a bump (a, b), then we add an edge from v a to v i in the same way.

Since we associate with each element of P a parent with strictly smaller index, the resulting graph does not have cycles. Moreover, it has n + 1 nodes and n edges, and therefore is a tree. Finally, we order the children of each node by their label in increasing order, and root the tree at v 0 . We thus obtain a plane rooted tree T P .

We now prove that the plane rooted tree T P obtained from Construction 1.22 is compatible with α so that we obtain the following map:

(6)
Λ nc : NC α → T α , P → T P .

Proposition 1.23. For a noncrossing α-partition P, the plane rooted tree T P is compatible with α.

Proof. Let α = (α 1 , α 2 , . . . , α r ) with |α| = n, and suppose that the nodes of T P are v 0 , v 1 , . . . , v n as in Construction 1.22. We define a full coloring f of T P , where f (v a ) = i if and only if a belongs to the i-th α-region in P. We now prove that Construction 1.4 does not fail on T P for α, and f agrees with the coloring of T P thus obtained. We proceed by induction on the number s of steps.

The elements in the first α-region do not lie below any bump of P, which means that Construction 1.4 does not fail in the first step. Moreover, by Construction 1.22 the nodes v 1 , v 2 , . . . , v α 1 are the leftmost children of the root of T P , and the partial labeling of Construction 1.4 therefore assigns the color 1 to all these nodes. Hence, this partial labeling agrees with f on the nodes colored by 1. This establishes the base case s = 1 of our induction. Now suppose that the induction hypothesis holds of s -1 < r, and we now consider step s. For a ∈ {α s-1 + 1, α s-1 + 2, . . . , α s }, let w be the parent of v a . By Construction 1.22, w is either the root, or w = v a for some a ≤ α s-1 . This implies f (w) ≤ s -1. Thus, v a is active in step s of Construction 1.4. Since a was chosen arbitrarily, we conclude that all vertices of T P that come from the s-th α-region are active in step s of Construction 1.4. Consequently, Construction 1.4 does not fail in step s.

We prove now that the nodes corresponding to elements in the s-th α-region are the first active nodes in LR-prefix order at step s. Suppose that at step s there are two active nodes v b 1 , v b 2 such that v b 1 precedes v b 2 in LR-prefix order, and

f (v b 1 ) > s = f (v b 2 ). Consequently, b 2 < b 1 , and both nodes belong to different α-regions. Let v a 1 , v a 2 denote the parents of v b 1 , v b 2 , respectively. If v a 1 = v a 2 ,
then by construction we must have b 1 < b 2 , which is a contradiction. If v a 1 is the root, then v b 1 also precedes v a 2 in LR-prefix order, and it is either colored or active in the step in which v a 2 receives its color. By our induction hypothesis we have

s < f (v b 1 ) ≤ f (v a 2 ) < s, which is a contradiction. If v a 2 is
the root, then since b 2 is not below any bump, the region of b 2 must not come later than that of a 1 (they can be in the same region). In combination with the induction hypothesis, we have

s = f (v b 2 ) ≤ f (v a 1 ) < s,
(i) If a 1 < a 2 < b 1 < b 2 ,
then either a 1 and a 2 are in the same α-region, or a 2 and b 1 are in the same α-region by (NC1). In both cases, we would have b

1 < b 2 , which is a contradiction. (ii) If a 1 < a 2 < b 2 < b 1 ,
then a 1 and a 2 belong to different α-regions by (NC2). Thus, v a 1 is colored before v a 2 is, which implies that v b 1 is active before v a 2 receives its color. Since v b 1 precedes v b 2 in LR-prefix order and v b 1 is not a descendant of v a 2 , we conclude that v b 1 precedes v a 2 in LR-prefix order, too. It follows that v b 1 receives its color not later than v a 2 , and by our induction hypothesis, we have

f (v b 1 ) ≤ f (v a 2 ) < s. This contradicts the assumption f (v b 1 ) > s. (iii) If a 2 < a 1 < b 1 < b 2 , then a 1 and a 2 belong to different α-regions by (NC2). This means that (a 1 , b 1 ) separates b 1 from (a 2 , b 2 ). Since f (v a 1 ) < s = f (v b 2 ), we have a 1 < b 2 , thus b 1 < b 1 < b 2 by the separation, which is a contradiction. (iv) If a 2 < a 1 < b 2 < b 1
, then either a 1 and a 2 belong to the same α-region, or a 1 and b 2 belong to the same α-region by (NC1). If a 1 and a 2 belong to the same α-region, then v a 2 precedes v a 1 in LR-prefix order (since a 2 < a 1 ). Moreover, since f (v a 1 ) = f (v a 2 ) ≤ s -1, by our induction hypothesis these two nodes receive the same color in Construction 1.4, and by Lemma 1.6(i) they are thus incomparable in

T P . Since v b 2 is a child of v a 2 , it follows that v b 2 precedes v b 1 in LR-prefix order,
which is a contradiction. If a 1 and b 2 belong to the same α-region, then necessarily b 2 belongs to this α-region, too. By induction hypothesis we have

s > f (v a 1 ) = f (v b 2 ) = s, which is a contradiction.
We therefore conclude that all the nodes of T P from the s-th α-region receive color s in step s of Construction 1.4, and we finish our induction step. We conclude that T P is an α-tree, and f is its left-aligned coloring.

We conclude this section with the proof that Ξ nc is a bijection with inverse Λ nc .

Theorem 1.24. For every integer composition α, the map Ξ nc is a bijection whose inverse is Λ nc . Moreover, Ξ nc sends internal nodes to bumps.

Proof. In view of Propositions 1.21 and 1.23, it remains to prove that

Ξ nc • Λ nc = id and Λ nc • Ξ nc = id.
To show that Ξ nc • Λ nc = id, for P ∈ NC α , let T = Λ nc (P) be the α-tree obtained from P by Construction 1.22, and P = Ξ nc (T) the noncrossing α-partition obtained from T by Construction 1.20.

Since every bump of P corresponds to an internal node of T, and every internal node of T corresponds to a bump of P , we conclude that P and P have the same number of bumps. Let (a, b) be a bump of P. The node v a is thus the parent of v b . Let i be an element of P such that v i is a child of v a in T. By Construction 1.22, we have a < i ≤ b. Hence, v i weakly precedes v b in LR-prefix order. This is valid for any child of v a in T, implying that v b is the rightmost child of v a in T, leading to a bump (a, b) in P by Construction 1.20. We thus conclude that P = P .

To show that Λ nc • Ξ nc = id, for T ∈ T α , let C be the left-aligned coloring of T, P = Ξ nc (T) and T = Λ nc (P). We now prove T = T . For u a non-leaf node of T and v a child of u, let a, b be the elements of P corresponding to u, v, and let u , v be the nodes of T corresponding to a, b. We first show that v is a child of u in T .

If u is the root, then b is not below any bump in P, meaning that u is the root of T and v one of its children by Construction 1.22. We now suppose that u is not the root. If v is the rightmost child of u, then (a, b) is a bump of P, and it follows from Construction 1.22 that v is the rightmost child of u , too.

It remains to consider the case that v is not the rightmost child of u. Let v r be the rightmost child of u, and let b r be the element of P corresponding to v r . It follows that (a, b r ) is a bump of P. Moreover, by Construction 1.4 we have C(u) < C(v) ≤ C(v r ), and Construction 1.20 then implies that a < b < b r . Hence, b lies below some bump, which implies that u is not the root of T . Moreover, b lies directly below a certain bump (a * , b * ).

(u) = C(v), which contradicts Lemma 1.6(i), since v is a child of u.
We conclude that a * = a, which implies that b lies directly below the bump (a, b r ). We observe that the order of the children a node in T and T depends only on the order of the elements of P by Constructions 1.20 and 1.22. We thus conclude that T = T .

= n, let T ∈ T α . For k ∈ [r], let s k = α 1 + α 2 + • • • + α k
as defined at the beginning of Section 1.1, which is precisely the number of nodes of color ≤ k. Moreover, let a k denote the number of active nodes in step (k + 1) of Construction 1.4 before coloring, which is precisely the number of nodes of color > k whose parents have color ≤ k. It is immediate that s k + a k ≤ n for all possible k.

We now construct a Dyck path which will have exactly one valley for each internal node of T. Suppose that the rightmost child of the i-th internal node of color k is the j-th active node in the (k + 1)-st step of Construction 1.4 before coloring. We mark the coordinate (p, q) in the plane, where p = s ki + 1 and q = s k + a kj. We then return the unique Dyck path µ T from (0, 0) to (n, n) that has valleys precisely at the marked coordinates.

Remark 1.26. There is a simpler way to informally describe Construction 1.25. We first draw the bounce path ν α , which encloses triangular regions with the main diagonal. Each such region corresponds to one color. For each internal node u of color k, with v its rightmost child, suppose that u is the i-th node from right to left of color k, and v the j-th active node from right to left at step (k + 1) of Construction 1.4. We then add a dot on the i-th column from left to right intersecting the triangular region of color k, in the j-th cell above the region. These dots indicate the valleys of µ T . The description here is equivalent to Construction 1.25. See Figure 5 for an illustration of Construction 1.25. We now prove that every Dyck path obtained by Construction 1.25 is in fact an α-Dyck path, so that we obtain the following map:

(7) Ξ nn : T α → D α , T → µ T .
Proposition 1.27. For an α-tree T, the Dyck path µ T obtained by Construction 1.25 is an α-Dyck path.

Proof. Let α = (α 1 , α 2 , . . . , α r ) be a composition of n. Recall from Section 1.1.3 that the α-bounce path is ν α = N α 1 E α 1 N α 2 E α 2 . . . N α r E α r .
We need to show that µ T is weakly above ν α , or equivalently, that all valleys of µ T lie weakly above ν α .

Let u be the i-th node of color k in T with respect to LR-prefix order. If u is a leaf, then it does not contribute a valley of µ T , and thus need not be considered. Let v be the rightmost child of u. Suppose that v is the j-th active node in the k-th step of Construction 1.4.

By construction, the corresponding valley of µ T has coordinate (p, q) with p = s ki + 1 and q = s k + a kj, where a k is the number of active nodes in the (k + 1)st step of Construction 1.4 before coloring. By construction we have i ≤ α k , therefore s k-1 < p ≤ s k . Moreover, since j ≤ a k , we have s k ≤ q < s k + a k . Therefore, (p, q) is weakly above ν α , with which we conclude the proof.

Let us now describe how to obtain a colored tree from an α-Dyck path.

Construction 1.28. Given α = (α 1 , α 2 , . . . , α r ) an integer composition, let µ ∈ D α . We initialize our algorithm with the tree T 0 which consists of a single root node v 0 (implicitly colored by color 0), and the empty coloring C 0 .

At the k-th step, we construct a (partially

) colored tree (T k , C k ) from (T k-1 , C k-1
) by adding as many children to the i-th node of color k -1 as there are north-steps in µ with x-coordinate equal to s k-1i + 1. After all childen have been added, we extend C k-1 to C k by assigning the value k to the first α k uncolored nodes in LR-prefix order. The algorithm fails if there are not enough uncolored nodes. After r steps, we obtain a colored tree (T r , C r ), and we return the plane rooted tree T µ = T r .

We now prove that the plane rooted tree obtained in Construction 1.28 is indeed compatible with α, which allows for the definition of a map (8)

Λ nn : D α → T α , µ → T µ .
Proposition 1.29. For an α-Dyck path µ, the plane rooted tree T µ obtained from Construction 1.28 is compatible with α.

Proof. Let α = (α 1 , α 2 , . . . , α r ). We first prove that we never run out of uncolored nodes in Construction 1.28. To that end, let s 0 = 0. For i ∈ {0, 1, . . . , r -1} we denote by m i the maximal y-coordinate of a lattice point on µ that has x-coordinate s i . Since µ is weakly above ν α , we have m i ≥ s i+1 .

We now prove by induction on k ∈ [r] that the number of uncolored non-root nodes at the end of step k in Construction 1.28 is precisely m k-1s k . The base case k = 1 holds, because in the first step, we add exactly m 0 children to the root, and we color α 1 = s 1 of them. Now suppose that the claim holds up to the k-th step of Construction 1.28. In particular, at the beginning of the (k + 1)-st step we already have m k-1s k uncolored nodes. In the (k + 1)-st step, we add m km k-1 new nodes, and color α k+1 of the uncolored nodes. This leaves us with

m k-1 -s k + m k -m k-1 -α k+1 = m k -s k+1
uncolored nodes, and we conclude the induction. Now we prove that T µ is an α-tree. Let f be the full coloring of T µ obtained in Construction 1.28. We show that f is the left-aligned coloring of T µ . Let f k denote the restriction of f to the nodes of T µ that have f -color at most k. We now prove that Construction 1.4 does not failed up to step k and that f k agrees with C k defined in Construction 1.4, once again by induction on k ∈ [r].

For the base case k = 1, by construction, the root of T µ has m 0 ≥ α 1 children, and we have f (v) = 1 if and only if v belongs to the α 1 leftmost children of the root. We see that Construction 1.4 does not fail in the first step, and the same nodes receive color 1 in both constructions.

Suppose that the induction hypothesis holds for k. The active nodes with respect to C k are thus precisely those whose parents have C k -color at most k. In step k + 1 of Construction 1.28, we add precisely m km k-1 new nodes, and after this addition, the parents of the uncolored nodes have f k -color at most k. By induction hypothesis, the uncolored nodes with respect to f k are precisely the active nodes with respect to C k . In view of the first part of this proof, Construction 1.4 does not fail in step k + 1, and since we color the α k+1 leftmost nodes in LR-prefix order by k + 1 in both constructions, the induction step is established.

We conclude that T µ is compatible with α and the coloring from Construction 1.28 is precisely the left-aligned coloring of T µ .

Remark 1.30. It follows from the proof of Proposition 1.29 that after we have created all the nodes in the (k + 1)-st step of Construction 1.4, there are m ks k active nodes before coloring, and m ks k+1 active nodes after coloring. Lemma 1.31. Given T ∈ T α , let u be an internal node in T and p = (p, q) the valley of µ = Ξ nn (T) corresponding to u. The number of children of u is equal to that of consecutive north-steps in Ξ nn (T) immediately after p.

Proof. Let c 1 be the number of children of u in T, and c 2 the number of consecutive north-steps in Ξ nn (T) immediately after p. Suppose that u has color k, and that the rightmost child of u is the j-th active node in LR-prefix order in the (k + 1)-st step of Construction 1.4 before coloring among a total of a k active nodes. Moreover, let m k be the maximal y-coordinate of a lattice point on µ with x-coordinate s k . It follows from Remark 1.30 that a k = m ks k . By Construction 1.25 we have

q = s k + a k -j = m k -j.
If u is the first internal node in its color group, then c 1 = j. By construction, p is the last valley whose x-coordinate is at most s k , which implies that c 2 = m kq = j.

Otherwise let u * be the internal node of color k that immediately precedes u in LR-prefix order. Suppose that the rightmost child of u * is the j * -th active node in LR-prefix order at step k + 1 of Construction 1.4 before coloring. It follows that c 1 = jj * . Moreover, let p * = (p * , q * ) be the valley of µ corresponding to u * . We know that p * is the valley immediately after p, and we have c 2 = q *q. Since q * = s k + a kj * = m kj * by Construction 1.25, we conclude that c 2 = jj * . We thus have c 1 = c 2 in all cases.

We now prove that Ξ nn is a bijection with inverse Λ nn .

Theorem 1.32. For every integer composition α = (α 1 , α 2 , . . . , α r ), the map Ξ nn is a bijection with inverse Λ nn . Moreover, Ξ nn sends internal nodes to valleys.

Proof. In view of Propositions 1.27 and 1.29, it remains to prove that Ξ nn • Λ nn = id and Λ nn • Ξ nn = id.

To show that Ξ nn • Λ nn = id, for µ ∈ D α , let T = Λ nn (µ) be the α-tree obtained from µ by Construction 1.28, and µ = Ξ nn (T) the α-Dyck path obtained from T by Construction 1.25. Since every valley of µ corresponds to an internal node of T, which in turn corresponds to a valley of µ , we conclude that µ and µ have the same number of valleys.

Let (p, q) be a valley of µ, and u the corresponding internal node of T, which is the (s kp + 1)-st node of color k in the LR-prefix order of T. Let m k be the maximal y-coordinate of a lattice point on µ with x-coordinate s k . By Remark 1.30, the number of active nodes in the (k + 1)-st step of Construction 1.4 (before coloring) is precisely a k = m ks k . The rightmost child of u is thus the (m kq)-th active node at step k in the LR-prefix order of T. By Construction 1.28, the internal node u and its rightmost child contribute a valley (p , q ) to µ , where p = s k -(s kp + 1) + 1 = p and q = s k + a k -(m kq) = q. Thus, the valleys of µ and µ agree, and it follows that µ = µ .

To show that Λ nn • Ξ nn = id, for T ∈ T α , let µ = Ξ nn (T) be the α-Dyck path obtained from T by Construction 1.25, and T = Λ nn (µ) the α-tree obtained from µ by Construction 1.28. For s ∈ [r], let T s , T s denote the induced subtrees of T, T , respectively, that consist of the nodes of color at most s. We prove by induction on s that T s = T s holds for all 0 ≤ s ≤ r.

The base case s = 0 is trivially true, since both trees T 0 and T 0 consist only of a root node. Suppose that T s-1 = T s-1 . Suppose that u is a node of T s-1 that has k > 0 children in T. By Lemma 1.31, either µ starts with k north-steps (if u is the root), or the valley corresponding to u is followed by k north-steps. By Construction 1.28, it follows that u also has k children. We also notice that, by construction, the positions of u and u among all active nodes in T s-1 and T s-1 are the same. Therefore, we have T s = T s .

We may now prove our first main result.

Theorem I. For every integer composition α, there is an explicit bijection from the set T α of α-trees to each of the following: the set S α (231) of (α, 231)-avoiding permutations, the set NC α of noncrossing α-partitions, and the set D α of α-Dyck paths.

Proof. The bijections are established in Theorems 1.19, 1.24, and 1.32.

We conclude this section by showing that the bijections Θ 1 and Θ 2 from Sections 1.2.1 and 1.2.2, respectively, can be recovered using the new bijections from Sections 1.2.3-1.2.5. Proposition 1.33. For every µ ∈ D α , we have

Θ 1 (µ) = Ξ nc • Λ nn (µ).
Proof. Let T = Λ nn (µ), P = Ξ nc (T), and P = Θ 1 (µ). By Theorem 1.32, we know that every valley of µ corresponds to an internal node u of T, with its coordinates dictating the exact position of u and its rightmost child v in the α-regions. By Theorem 1.24, each such pair (u, v) corresponds to a bump (a, b) of P, where a and b are determined by the positions of u and v. If we now take the corresponding valley of µ, and apply Construction 1.7, then we see that (a, b) is also a bump of P . We conclude that P = P . Proposition 1.34. For every P ∈ NC α , we have Θ 2 (P) = Ξ perm • Λ nc (P).

Proof. Let T = Λ nc (P), w = Ξ perm (T), and w = Θ 2 (P). We prove by induction on n = |α| that w = w . The base case n = 0 clearly holds. Now suppose that our claim holds for all α with |α | < n.

We take the block of P containing 1, and denote it by

P • = {i 1 , i 2 , . . . , i s } with i 1 < i 2 < • • • < i s and i 1 = 1. By Construction 1.11, we have w (i 1 ) = w i 2 + 1 = • • • = w i s + s -1.
The remaining values of w are determined inductively from two parabolic noncrossing partitions P 1 and P 2 with strictly less than n elements each. By induction hypothesis we have Θ 2

(P i ) = Ξ perm • Λ nc (P i ) for i ∈ {1, 2}.
On the other hand, by Construction 1.22, the elements in P • correspond to nodes in T on the rightmost branch of the first child u of the root, that is, the set of nodes visited from u by always moving to the rightmost child when possible. The label of u in Construction 1.14 is always w(1), and the label of the rightmost child of any node v is always one less than the label of v itself. Finally, by comparing Constructions 1.11 and 1.22 we see that the elements contributing to w (1) are precisely the nodes in the subtree of u, and we conclude that w and w agree on P • . Now let T 2 be the induced subtree of T containing all the elements that are descendants of all but the first root children, and let w 2 = Ξ perm (T 2 ). Moreover, we construct a new tree T 1 from T by first deleting the root and all nodes of T 2 , and then contracting the rightmost branch of u into a new root node while keeping the LR-prefix order of the remaining nodes.Let w 1 = Ξ perm (T 1 ). The elements of T 1 and T 2 , respectively, are in the same relative order as in T with respect to LRpostfix order. Hence, w can be reconstructed from the values w(i 1 ), w(i 2 ), . . . , w(i s ), the values in w 1 and the values in w 2 increased by w(1). This is precisely the way that w was created, so we conclude that w = w .

Part 2. Tamari Lattices in Parabolic Cataland

In the middle part of this article, we equip each of the sets S α (231) and D α with a partial order, and show that the resulting posets are isomorphic (Theorem II). Both posets are in fact lattices and generalize the well-known Tamari lattice T n introduced in [START_REF] Tamari | Monoides Préordonnés et Chaînes de Malcev[END_REF][START_REF]The algebra of bracketings and their enumeration[END_REF]. See [START_REF] Folkert M Üller-Hoissen | Tamari Lattices and Related Structures[END_REF] for a recent survey on topics related to the Tamari lattices.

For the proof of this isomorphism, we need some lattice-theoretic background, which is only relevant for the current section. We have thus decided to put it in Appendix A, which can be consulted whenever necessary. (2, 4)

(2, 3) (1, 4) (2, 5) (1, 5) (1, 3) (3, 5) (4, 5)
(b) The Galois graph of T (2,2,1) .

Figure 6. The lattice T (2,2,1) and its Galois graph.

PARABOLIC TAMARI LATTICES

For every permutation w ∈ S n we define its inversion set by inv(w) def = (i, j) | i < j and w(i) > w(j) .

The elements of inv(w) are the inversions of w. In particular, every descent of w is also an inversion. The (left) weak order on S n is defined by setting w 1 ≤ L w 2 if and only if inv(w 1 ) ⊆ inv(w 2 ) for all w 1 , w 2 ∈ S n .

Definition 2.1. The parabolic Tamari lattice T α def = S α (231), ≤ L is defined to be the restriction of the weak order to (α, 231)-avoiding permutations.

Figure 6a shows the parabolic Tamari lattice T (2,2,1) . The elements of S (2,2,1) (231) are shown in one-line notation, where the (2, 2, 1)-regions are separated by vertical bars. Theorem 1.1 in [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF] states that T α is indeed a lattice. Moreover, the following structural result holds. Recall from Section 1.1 that, for an integer composition α = (α 1 , α 2 , . . . , α r ), the reverse composition is α = (α r , α r-1 , . . . , α 1 ).

Moreover, for every n > 0, and every permutation w ∈ S n we define the reverse permutation w by setting

w(i) = w(n + 1 -i) for i ∈ [n]. If w ∈ S α ,
and we additionally reverse the order of the entries of each α-region of w, then we obtain a permutation w ∈ S α .

For example, let w = 24|157|3|6 ∈ S (2,3,1,1) . Then we have w = 6375142, and w = 6|3|157|24 ∈ S (1,1,3,2) . Lemma 2.4. Let w 1 , w 2 ∈ S α . We have inv(w 1 ) ⊆ inv(w 2 ) if and only if inv( w 1 ) ⊇ inv( w 2 ).

Proof. Let α = (α 1 , α 2 , . . . , α r ) be an integer composition. We only prove the implication "inv(w 1 ) ⊆ inv(w 2 ) implies inv( w 1 ) ⊇ inv( w 2 )", the other implication follows analogously.

Let w 1 , w 2 ∈ S α such that inv(w 1 ) ⊆ inv(w 2 ), and choose integers a, b in different α-regions such that (a, b) / ∈ inv( w 1 ). Let a , b be the unique indices with w 1 (a ) = w 1 (a) and w 1 (b ) = w 1 (b). Since the entries in each α-region are ordered linearly, and by going from w 1 to w 1 we revert this order, we conclude that w 2 (a ) = w 2 (a) and w 2 (b ) = w 2 (b).

Suppose that a belongs to the i-th α-region, and suppose that b belongs to the j-th α-region. Since a < b we have i < j. (By construction, it follows from w 1 ∈ S α that there are no inversions within the same α-region.) By construction we conclude that a and a belong to the (r + 1i)-th α-region and b and b belong to the (r + 1j)-th α-region. It follows that b < a .

Since (a, b) / ∈ inv( w 1 ) we must have

w 1 (a ) = w 1 (a) < w 1 (b) = w 1 (b ), which implies (b , a ) ∈ inv(w 1 ) ⊆ inv(w 2 ). It follows that w 2 (b) = w 2 (b ) > w 2 (a ) = w 2 (a), which yields (a, b) / ∈ inv( w 2 )
. By contraposition we conclude that inv( w 1 ) ⊇ inv( w 2 ). Definition 2.5. In a permutation w ∈ S α , an (α, 132)-pattern is a triple of indices i < j < k each in different α-regions such that w(i) < w(k) < w(j) and w(k) = w(i) + 1. A permutation in S α without (α, 132)-patterns is (α, 132)-avoiding.

We denote the set of all (α, 132)-avoiding permutations of S α by S α (132), and consider how reversal acts on (α, 231)-patterns. Lemma 2.6. A permutation w ∈ S α has an (α, 231)-pattern if and only if w ∈ S α has an (α, 132)-pattern.

Proof. We only prove the implication "w has an (α, 231)-pattern implies that w has an (α, 132)-pattern", the other implication follows analogously. Let w ∈ S α have an (α, 231)-pattern (i, j, k). Let a = w(i), b = w(j) and c = w(k). By Definition 1.1 we have i < j < k in different α-regions, a < b and a = c + 1. Let i , j , k be such that w(i ) = a, w(j ) = b and w(k ) = c. As in the proof of Lemma 2.4 we find that k < j < i are in different α-regions. By Definition 2.5, (k , j , i ) is an (α, 132)-pattern of w. Theorem 2.7. For every integer composition α, the lattice T α is isomorphic to the dual of T α .

Proof. We use the fact that T α arises as a quotient lattice of S α , ≤ L [26, Proposition 3.18]. It follows from [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF]Section 3.4] that the set of greatest elements of the corresponding congruence-classes is precisely S α (132), and the set of least elements of the corresponding congruence-classes is S α (231).

Let us define a partial order on the symmetric group by setting w 1 ≤ R w 2 if and only if inv(w 1 ) ⊇ inv(w 2 ). We conclude that the dual lattice of T α = S α (231), ≤ L is isomorphic to S α (132), ≤ R . Lemmas 2.4 and 2.6 now imply that S α (132), ≤ R ∼ = S α (231), ≤ L = T α .

Compare Figures 6a and7 for an illustration of Theorem 2.7.

ν α -TAMARI LATTICES

In this section we define a partial order on the set D α of all α-Dyck paths. This construction can in fact be carried out for any set of Dyck paths that stay weakly above a fixed path ν formed by north and east steps. See [START_REF] Ceballos | The ν-Tamari lattice via ν-trees, ν-bracket vectors, and subword complexes[END_REF][START_REF] ¸ois Préville-Ratelle | The enumeration of generalized Tamari intervals[END_REF] for the general setup. All of the following structural properties of ν α -Tamari lattices hold in this general case, too.

Let µ ∈ D α , and consider a lattice point p in µ. We define horiz α ( p) to be the maximal number of east-steps that can be added after p without crossing ν α . For any valley p of µ, let q be the first lattice point on µ such that horiz α ( p) = horiz α ( q). We denote by µ[ p, q] the subpath of µ from p to q. Let µ be the unique α-Dyck path which arises from µ by swapping the subpath µ[ p, q] with the east step preceding p. Let us abbreviate this operation by µ α µ .

This operation induces an acyclic relation on D α , and we denote by ≤ α its reflexive and transitive closure. The ν (1,2,2) -Tamari lattice is shown in Figure 8a. Theorem 2.9. For every integer composition α, the ν α -lattice T ν α is extremal and congruence uniform.

Proof. First of all, [28, Theorem 1] states that T ν α is indeed a lattice. Moreover, [28, Theorem 3] states that T ν α is an interval in T 2|α|+1 .

It was shown in [START_REF] Markowsky | Primes, irreducibles and extremal lattices[END_REF]Theorem 22] that T N is extremal for every integer N > 0. However, it follows from [START_REF] Markowsky | Primes, irreducibles and extremal lattices[END_REF]Theorem 14(ii)] that intervals of extremal lattices need not be extremal. Fortunately, [START_REF] Thomas | An analogue of distributivity for ungraded lattices[END_REF]Theorem 9] implies that T N is trim. (This is a property that is somewhat stronger than extremality.) Theorem 1 in [START_REF] Thomas | An analogue of distributivity for ungraded lattices[END_REF] states that every interval of a trim lattice is trim, too. We conclude that T ν α is trim, and therefore extremal.

Theorem 3.5 in [START_REF] Geyer | On Tamari lattices[END_REF] states that T N is congruence uniform for every integer N > 0, and [10, Theorem 4.3] implies that intervals of congruence-uniform lattices are congruence uniform again. We conclude that T ν α is congruence uniform.

We conclude this section with another useful result, which nicely parallels Theorem 2.7.

Theorem 2.10 ([28, Theorem 2]

). For every integer composition α, the lattice T ν α is isomorphic to the dual of T ν α .

2.2.1. ν α -Bracket Vectors. Following [START_REF] Ceballos | The ν-Tamari lattice via ν-trees, ν-bracket vectors, and subword complexes[END_REF], we may as well represent T ν α as a lattice of certain integer vectors under componentwise order.

Let n = |α|. The minimal ν α -bracket vector b min is the vector with 2n + 1 entries that contains the y-coordinates of the lattice points of ν α read in order from (0, 0) to (n, n). The fixed positions are the elements of the set F = { f 0 , f 1 , . . . , f n }, where f i denotes the last occurrence of i in b min .

Definition 2.11. A ν α -bracket vector is a vector

b = (b 1 , b 2 , . . . , b 2n+1 ) that satisfies • b f i = i for 0 ≤ i ≤ n; • b min i ≤ b i ≤ n for all i; • if b i = k, then b j ≤ k for all i ≤ j ≤ f k .
Theorem 2.12 ([9, Theorem 4.2]). For every integer composition α, the lattice of ν αbracket vectors under componentwise order is isomorphic to T ν α .

For µ ∈ D α we may directly construct the corresponding ν α -bracket vector as follows; see [9, Section 4.3]. Construction 2.13. Let µ ∈ D α for some integer composition α. Suppose that µ runs through k i lattice points of y-coordinate i. We start with an empty vector b 0 of length 2n + 1. In the i-th step we construct b i from b i-1 by filling the k i rightmost available spaces before and including the fixed position f i with the value i. After n steps we return the bracket vector b µ = b n .

Given a ν α -bracket vector b, we denote by b the reduced ν α -bracket vector, i.e. the vector that contains all entries of b in the same order, except for those at the fixed positions. It is clear that b ≤ b if and only if b ≤ b , where ≤ is componentwise order. Figure 8b shows the lattice of reduced ν (1,2,2) -bracket vectors. Figure 8. Two representations of a ν α -Tamari lattice.

2.2.2.

The Galois Graph of T ν α . By Theorem 2.9, the lattice T ν α is extremal for every integer composition α, and by Theorem A.1 we may represent T ν α by its Galois graph. In this section, we characterize the Galois graph of T ν α . Since T ν α is also congruence uniform, we may apply Proposition A.4 and define Gal T ν α in terms of the join-irreducible elements of T ν α . In general, however, it is much easier to describe meet-irreducible Dyck paths (because they have a unique valley). In view of Theorem 2.10, we may regard Gal T ν α as a directed graph with vertex set M T ν α , where there is a directed edge µ → μ if and only if µ = μ and μ ≥ μ * ∧ µ.

Since meet-irreducible Dyck paths are precisely those with a unique valley, we may write µ p,q for the unique meet-irreducible element of T ν α that has its only valley at (p, q). Moreover, we abbreviate k (m) def = k, k, . . . , k m for any integer k, and any nonnegative integer m. Let α = (α 1 , α 2 , . . . , α r ) be a composition of n, and recall that we have defined

s i = α 1 + α 2 + • • • + α i and t i = n -s r-i for all i ∈ {0, 1, . . . , r} in the beginning of Section 1.1.
Lemma 2.14. Let µ p,q ∈ M(T ν α ), where t k ≤ q < t k+1 for some k ∈ [r]. The reduced ν α -bracket vector of µ p,q is b(µ p,q ) = n (t k -p) , q (p) , n (n-t k ) .

Moreover, the reduced ν α -bracket vector of the unique upper cover µ * p,q of µ p,q is

b(µ * p,q ) =    n (t k -p) , q + 1, q (p-1) , n (n-t k ) , if q < t k+1 -1, n (t k -p+1) , q (p-1) , n (n-t k ) , if q = t k+1 -1. (2, 4) (1, 4) (2, 3) (3, 4) (3, 3) (1, 1) (1, 2)
(1, 3)

Figure 9. The Galois graph of T ν (2,2,1) .

Proof. We will use Construction 2.13. Since µ p,q has a unique valley, it contains precisely p lattice points of y-coordinate q, and np lattice points of y-coordinate n. Every other y-coordinate is met exactly once. Therefore, the y-coordinates in

[n] \ {q, n} fill only fixed positions, and all the other positions in the bracket vector of µ p,q are filled with either q or n. Now, since we reach y-coordinate q strictly before we reach y-coordinate n, we may first insert p-times the value q, and then fill the remaining available positions with values n (possibly before the first q and certainly after the last). Let (p , q ) be the next lattice point on µ p,q with horiz ν α (p , q ) = horiz ν α (p, q) .

If q = t k+1 -1, then (p , q ) is nhoriz ν α (p, q) , n , and if q < t k+1 -1, then (p , q ) = (p, q + 1). The description of the reduced bracket vector of µ * p,q follows immediately.

Lemma 2.15. Let µ p 1 ,q 1 , µ p 2 ,q 2 ∈ M T ν α , where t k 1 ≤ q 1 < t k 1 +1 and t k 2 ≤ q 2 < t k 2 +1 for some k 1 , k 2 ∈ [r]. We have µ p 2 ,q 2 ≥ µ * p 2 ,q 2 ∧ µ p 1 ,q 1 if and only if t k 1p 1 ≤ t k 2p 2 < t k 1 and q 1 ≤ q 2 . Proof. From Lemma 2.14 it follows that b(µ p 1 ,q 1 ) = n (t k 1 -p 1 ) , q

(p 1 ) 1 , n (n-t k 1 ) , b(µ p 2 ,q 2 ) = n (t k 2 -p 2 ) , q (p 2 ) 2 , n (n-t k 2 ) , b(µ * p 2 ,q 2 ) = n (t k 2 -p 2 ) , q 2 , q (p 2 -1) 2 , n (n-t k 2 ) ,
where q 2 > q 2 . For i ∈ [n] let a i denote the i-th entry in b(µ p 1 ,q 1 ), let b i denote the i-th entry in b(µ p 2 ,q 2 ), let c i denote the i-th entry in b(µ * p 2 ,q 2 ). In order to determine when µ p 2 ,q 2 ≥ µ * p 2 ,q 2 ∧ µ p 1 ,q 1 is satisfied, we have to figure out under which conditions

(9) b i ≥ min(c i , a i ) holds for all i ∈ [n]. By Lemma 2.14 it follows that b i = c i for i = t k 2 -p 2 + 1 and b t k 2 -p 2 +1 < c t k 2 -p 2 +1 .
Hence, (9) holds trivially if i = t k 2p 2 + 1. It thus remains to consider the case i = t k 2p 2 + 1. We have c i = q 2 > q 2 , which implies that min(a i , c i ) ≤ b i holds if and only if a i ≤ b i . In particular, we need to have a i < n, which is the case precisely when

t k 1 -p 1 < i ≤ t k 1 .
We may thus conclude the following description of the Galois graph of T ν α , which is illustrated in Figure 9 for α = (2, 2, 1). Figure 10. In the Galois graph of the ν-Tamari lattice given by the above bounce path, there exist a directed arrow from the box with a red dot to any of the boxes with a cross. (We identify boxes with the lattice points on their bottom right corner.) Theorem 2.16. Let α be an integer composition into r parts, and let ν α be the corresponding α-bounce path. The Galois graph of T ν α is isomorphic to the directed graph with vertex set

(p, q) | 1 ≤ p ≤ t k ≤ q < t k+1 for some k ∈ [r -1] ,
where there is a directed edge from (p 1 , q 1 ) → (p 2 , q 2 ) if and only if (p 1 , q 1 ) = (p 2 , q 2 ) and t k 1p 1 ≤ t k 2p 2 < t k 1 and q 1 ≤ q 2 , where k 1 and k 2 are the unique indices in [r] with t k 1 ≤ q 1 < t k 1 +1 and t k 2 ≤ q 2 < t k 2 +1 .

Proof. We have seen in Theorem 2.9 that T ν α is extremal and congruence uniform, and therefore, by Proposition A.4, its Galois graph is (isomorphic to) the directed graph on the vertex set J (T ν α ), which has a directed edge x → y if and only if x = y and y ≤ y * ∨ x. Now, Theorem 2.10 implies that T ν α ∼ = T ν α , and let us denote this isomorphism by Ψ. It follows that µ ∈ J T ν α if and only if Ψ(µ) ∈ M T ν α , and for µ 1 , µ 2 ∈ J T ν α we have µ 2 ≤ (µ 2 ) * ∨ µ 1 if and only if Ψ(µ 2 ) ≥ Ψ(µ 2 ) * ∧ Ψ(µ 1 ). We may therefore use Lemma 2.15 to describe Gal(T ν α ).

Let V denote the set of pairs (p, q) with 1 ≤ p ≤ t k ≤ q < t k+1 for some k ∈ [r -1]. Let G be the directed graph with vertex set V, which has a directed edge precisely under the conditions given in the statement.

It is straightforward to verify that the elements of V are precisely the lattice points in the rectangle from (0, 0) to (n, n) that do not have a coordinate equal to 0 or n, and that lie weakly above ν α . Therefore, for each such pair (p, q) we can find a unique ν α -path that has a unique valley at (p, q). Hence, the vertices of G are in bijection with the meet-irreducible elements of T ν α via the map (p, q) → µ p,q .

By Lemma 2.15 we see that there exists a directed edge (p 1 , q 1 ) → (p 2 , q 2 ) in G if and only if µ p 1 ,q 1 = µ p 2 ,q 2 and µ p 2 ,q 2 ≥ µ * p 2 ,q 2 ∧ µ p 1 ,q 1 . In view of the first paragraph of this proof, this is exactly the case when there exists a directed edge Ψ -1 (µ p 1 ,q 1 ) → Ψ -1 (µ p 2 ,q 2 ) in Gal T ν α . We conclude that G and Gal T ν α are isomorphic.

We may identify the lattice points (p, q) above ν α with the box that has (p, q) as its lower right corner. From this perspective, Figure 10 illustrates Theorem 2.16, by indicating to which boxes an arrow from the highlighted box may go in the Galois graph.

Corollary 2.17. Let α be an integer composition. In the Galois graph of T ν α the vertex (p, q) has precisely p |α|q -1 outgoing arrows.

Proof. This follows immediately from Theorem 2.16.

T α AND T ν α ARE ISOMORPHIC

In this section we prove that for every integer composition α the lattices T ν α and T α are isomorphic. In order to achieve this we make use of the bijective correspondence between the sets S α (231) and D α that was first described in [26, Theorem 1.2], and recalled here in Sections 1.2.1 and 1.2.2.

Let Θ 1 and Θ 2 be the bijections from Theorems 1.8 and 1.13. Consequently, the map

Θ : D α → S α (231), µ → Θ 2 • Θ 1 (µ) is a bijection.
Remark 2.18. Note that there is a slight subtlety to our approach. The bijection Θ maps elements of D α to elements of S α (231), and therefore reverses the composition. In fact, this comes in handy, because Theorems 2.7 and 2.10 state that reversing the composition corresponds to taking the lattice dual. Theorem 2.3 describes the Galois graph of T α , while Theorem 2.16 uses the dual perspective to describe the Galois graph of T ν α . Therefore, everything is in place for the map Θ to take effect. This is also the reason why we did not use the map Ξ perm • Λ nn in this section.

We now show that the map Θ extends to an isomorphism from Gal(T ν α ) to Gal(T α ). Let us write w a,b for the unique join-irreducible element of T α whose unique descent is (a, b), and recall that µ p,q is the unique meet-irreducible element of T ν α that has its unique valley at (p, q). Lemma 2.19. Let µ p,q ∈ M T ν α such that t k ≤ q < t k+1 . The image of Θ(µ p,q ) is w a,b ∈ J T α , where

a = s r-k-1 + q -n + s r-k + 1, b = s r-k + p.
In particular, a belongs to the (rk)-th α-region, and b belongs to the i-th α-region for some i > rk.

Proof. Since µ p,q has a unique valley at (p, q), it follows from Construction 1.7 that Θ 1 (µ p,q ) has a unique bump at positions a, b with a = s r-k-1 + + 1, where q = t k + for a unique index k ∈ [r], and b = s r-k + p. (The value of b follows immediately, since there is no other bump in Θ 1 (µ p,q ) that could potentially block elements.) By Construction 1.11 we get that w = Θ(µ p,q ) has (a, b) as its unique inversion, which proves the first claim.

By construction we have s r-k = nt k , and since t k ≤ q < t k+1 we conclude that s r-k-1 < a ≤ s r-k , meaning that a belongs to the (rk)-th α-region. Moreover, since p ≥ 1, we conclude that b > s r-k , which implies the last statement. Theorem 2.20. Let α be an integer composition. The map Θ induces an isomorphism from Gal T ν α to Gal T α .

Proof. Let α = (α 1 , α 2 , . . . , α r ) with n = |α|. We denote by G ν α the Galois graph of T ν α , and by G α that of T α . It follows from Lemma 2.19 and the fact that Θ is a bijection which sends descents to valleys, that the vertex sets of G ν α and G α are in bijection via Θ. Now let (p 1 , q 1 ), (p 2 , q 2 ) be two vertices of

G ν α such that t k 1 ≤ q 1 < t k 1 +1 and t k 2 ≤ q 2 < t k 2 +1 for some k 1 , k 2 ∈ [r].
By Lemma 2.19 we have Θ(µ p 1 ,q 1 ) = w a 1 ,b 1 and Θ(µ p 2 ,q 2 ) = w a 2 ,b 2 , where

a 1 = s r-k 1 -1 + s r-k 1 + q 1 + 1 -n, b 1 = s r-k 1 + p 1 , a 2 = s r-k 2 -1 + s r-k 2 + q 2 + 1 -n, b 2 = s r-k 2 + p 2 .
Moreover, if we assume that (p 1 , q 1 ) = (p 2 , q 2 ), then we see that (a 1 , b 1 ) = (a 2 , b 2 ).

Suppose that there is a directed edge (p 1 , q 1 ) → (p 2 , q 2 ) in G ν α . Theorem 2.16 then implies that t k 1p 1 ≤ t k 2p 2 < t k 2 and q 1 ≤ q 2 . Since q 1 ≤ q 2 , we conclude that t k 1 ≤ t k 2 . Therefore, from the definition of t k , we have two cases,

k 1 = k 2 or k 1 < k 2 . (i) If k 1 = k 2 ,
then it follows that a 1 and a 2 belong to the same α-region, and we must have a 1 ≤ a 2 . From the fact that t k 1p 1 ≤ t k 2p 2 follows p 2 ≤ p 1 , and therefore b 2 ≤ b 1 . Lemma 2.19 implies further that a 2 < b 2 ; it follows now from Theorem 2.3 that there exists a directed edge (a

1 , b 1 ) → (a 2 , b 2 ) in G α . (ii) If k 1 < k 2 , then Lemma 2.
19 implies that a 1 belongs to the (rk 1 )-th αregion, and a 2 belongs to the (rk 2 )-th α-region. It is clear that rk 2 < rk 1 , which implies a 2 < a 1 . Moreover, we have

t k 1 -p 1 = n -s r-k 1 -p 1 = n -(s r-k 1 + p 1 ) = n -b 1 , t k 2 -p 2 = n -s r-k 2 -p 2 = n -(s r-k 2 + p 2 ) = n -b 2 .
By assumption we have

t k 1 -p 1 ≤ t k 2 -p 2 , which implies b 2 ≤ b 1 . Finally, t k 2 - p 2 < t k 1 implies b 2 > s r-k 1 . Therefore, Theorem 2.3 tells us that there is a directed edge (a 1 , b 1 ) → (a 2 , b 2 ) in G α .
Conversely, let (a 1 , b 1 ), (a 2 , b 2 ) be two vertices of G α such that a 1 belongs to the (rk 1 )-th α-region and a 2 belongs to the (rk 2 )-th α-region.

By Lemma 2.19 we have Θ -1 (w a 1 ,b 1 ) = µ p 1 ,q 1 and Θ(w a 2 ,b 2 ) = µ p 2 ,q 2 , where

p 1 = b 1 -s r-k 1 , q 1 = n + a 1 -s r-k 1 -1 -s r-k 1 -1, p 2 = b 2 -s r-k 2 , q 2 = n + a 2 -s r-k 2 -1 -s r-k 2 -1,
and

t k 1 ≤ q 1 < t k 1 +1 and t k 2 ≤ q 2 < t k 2 +1 . Moreover, if we assume that (a 1 , b 1 ) = (a 2 , b 2 ), then we see that (p 1 , q 1 ) = (p 2 , q 2 ). Suppose that there is a directed edge (a 1 , b 1 ) → (a 2 , b 2 ) in G α . Theorem 2.3 implies first of all that r -k 2 ≤ r -k 1 . (i) If k 1 = k 2 , then Theorem 2.3 implies also that a 1 ≤ a 2 < b 2 ≤ b 1 .
It follows immediately that q 1 ≤ q 2 , and t k 1p 1 ≤ t k 1p 2 . Moreover, since p 2 > 0, we have t k 1p 2 < t k 1 . Theorem 2.16 states that there exists a directed edge (p 1 , q 1 ) →

(p 2 , q 2 ) in G ν α . (ii) If r -k 2 < r -k 1 , then Theorem 2.3 implies further that s r-k 1 < b 2 ≤ b 1 . This means exactly that s r-k 1 < p 2 + s r-k 2 ≤ p 1 + s r-k 1 . It follows that n -s r-k 1 > n - s r-k 2 -p 2 ≥ n -s r-k 1 -p 1 , which means precisely that t k 1 > t k 2 -p 2 ≥ t k 1 -p 1 .
↓ Θ 1 ↓ Θ 1 ↓ Θ 2 ↓ Θ 2
Moreover, s r-k 1 > s r-k 2 implies t k 1 < t k 2 , and we conclude that q 1 < t k 1 +1 ≤ t k 2 ≤ q 2 . Theorem 2.16 now states that there exists a directed edge (p 1 , q 1 ) → (p 2 , q 2 ) in G ν α .

We have thus shown that Θ induces an isomorphism of directed graphs from G ν α to G α , and the proof is complete.

We may now prove Theorem II, which states that T ν α and T α are isomorphic.

Theorem II. For every integer composition α, the parabolic Tamari lattice T α is isomorphic to the ν α -Tamari lattice T ν α .

Proof. Theorems 2.2 and 2.9 state that the lattices T α and T ν α are both extremal lattices, and Theorem 2.20 states that their Galois graphs are isomorphic. We may thus conclude the result as described in Remark A.2.

Corollary 2.21. For every integer composition α, the lattice T ν α is isomorphic to the dual of T α .

Proof. This follows from Theorems 2.10 and II.

Remark 2.22. We may as well prove Theorem 2.7 by combining Theorems II and 2.10.

In fact, we suspect that the map Θ is an isomorphism from T ν α to T α , but we have not succeeded proving this directly. See also Remark A.3. Figure 11 shows a cover relation in T ν (3,4,2,1,3,1) and the corresponding cover relation in T (1,3,1,2,4,3) under the map Θ.

Open Problem 2.23. Show that Θ is a lattice isomorphism from T ν α to T α .

Part 3. The Zeta Map in Parabolic Cataland

In the last part of this article, we prove the Steep-Bounce Conjecture of Bergeron, Ceballos and Pilaud; see [START_REF] Bergeron | Hopf Dreams and Diagonal Harmonics[END_REF]Conjecture 2.2.8]. This conjecture arises as a combinatorial approach to understand an intriguing connection between the study of certain lattice walks in the positive quarter plane, and certain Hopf algebras with applications in the theory of multivariate diagonal harmonics.

We prove this conjecture by relating two families of nested Dyck paths via the left-aligned colorable trees (α-trees) from Section 1.1.4. Since a tree T can be an αtree for potentially several choices of α, it is convenient to consider the following definition. Definition 3.1. A LAC tree of size n is a pair (T, α), where T is an α-tree for a composition α of n (α |= n). For n > 0, we denote by

LAC n def = (T, α) | α |= n, T ∈ T α
the set of all LAC trees of size n.

In contrast to the bijections defined in Section 1.2, where a composition α is fixed, the bijections we define in this section will consider all compositions of n at the same time.

LEVEL-MARKED DYCK PATHS

In view of Definition 1.3, a Dyck path is simply a (1, 1, . . . , 1)-Dyck path. Let D n denote the set of all Dyck paths with 2n steps. Definition 3.2. A marked Dyck path µ • is a Dyck path with two types of north-steps: marked ones denoted by N • , and unmarked ones denoted by N • . It is level-marked if, for each lattice point p on µ, the number of unmarked north-steps before p does not exceed the number of east-steps before p. Remark 3.3. As an equivalent definition, µ • is level-marked if and only if for each lattice point (p, q) on µ • , there are at least qp marked north-steps before it.

The set of all level-marked Dyck paths is denoted by D • n . Level-marked Dyck paths have been introduced in [5, Section 2.2.3] under the name "colored Dyck paths", and it was shown in that paper that D • n is in bijection with the set of lattice walks in N × N with 2n steps taken from the set (0, 1), (-1, 1), (1, -1) that start at the origin and end on the x-axis. The bijection goes by sending N • to (0, 1), N • to (-1, 1) and E to (1, -1). An example of a level-marked Dyck path is shown in the middle of Figure 12.

We define the right-to-left traversal of a plane rooted tree T to be the depth-first search in T starting from the root, where children of the same node are visisted from right to left.

The following construction describes how to obtain a marked Dyck path from an α-tree with n = |α|. Construction 3.4. Given an integer composition α, let T ∈ T α and C its corresponding left-aligned coloring. We construct a marked Dyck path µ • T , starting from the origin, by performing a right-to-left traversal of T. Whenever we visit a new node in T with a C-color we have not seen before, we add a marked northstep N • , otherwise we add an unmarked north-step N • . When we visit a node that we have visited before, we add an east-step.

The left part of Figure 12 illustrates Construction 3.4. In the α-tree on the left of that figure, the first vertices per color in the right-to-left traversal are marked.

We now prove that the following map is well defined with the correct domain and image:

(10) Ξ dyck : LAC n → D • n , (T, α) → µ • T . Proposition 3.5.
For a LAC tree (T, α), the marked Dyck path µ • T obtained by Construction 3.4 is indeed a level-marked Dyck path with 2|α| steps.

Proof. Since Construction 3.4 is simply a variant of the classical bijection between rooted plane trees and Dyck paths, it is clear that µ • T is a Dyck path. To see that it is level-marked, we only need to consider the endpoint (p, q) of any north step in µ • T which corresponds to the first visit of a node u in T. By Lemma 1.6(i), all nodes on the path from u to the root, including u and excluding the root, are of different colors. There are exactly qp such nodes, meaning that up to (p, q) we have seen at least qp colors in the traversal of Construction 3.4. Hence, at least qp marked north steps come before the point (p, q), making µ • T a level-marked Dyck path.

We now explain how to obtain a colored tree from a level-marked Dyck path. Construction 3.6. For n > 0 and µ • ∈ D • n , suppose that µ • has precisely r marked north-steps. We initialize our construction with the tree T 0 that consists of a single root node, the empty coloring f 0 , and a list of colors L 0 = [0], where 0 stands for the color of the root. Throughout this construction we maintain a pointer on the colors. Initially, this pointer points to the 0 in L 0 . Moreover, since we traverse the tree during its construction, we say that the current node is the node that we are visiting in the current step, which is the root at the beginning.

We parse µ • as a word. Let x be the i-th letter of this word. We then update T i-1 , f i-1 , L i-1 as follows.

(i) If x = N • , then we extend T i-1 to T i by adding a node v i to the current node of T i-1 as its leftmost child. We set the current node of T i to be v i . We insert a new color c into L i-1 right after the pointer, and move the pointer to c. We extend f i-1 to f i by setting f i (v i ) = c.

(ii) If x = N • , then we extend T i-1 to T i by adding a child v i to the current node of T i-1 as its leftmost child. We set the current node of T i to be v i . We take L i to simply be L i-1 with the pointer moved to the next color c . We extend f i-1 to f i by setting f i (v i ) = c . (iii) If x = E, then we take T i to simply be T i-1 with the current node set to the parent of the current node of T i-1 . We take L i to be L i-1 with the pointer moved to the previous color. Since µ • is a Dyck path, such a color (may be 0 for the root) must exist. We set f i = f i-1 . Let f i be the coloring of T i that is obtained from f i by renaming the colors according to first appearance in the left-to-right traversal of T i . After 2n steps we have parsed µ • completely, and we output the colored tree T µ • = (T 2n , f 2n ).

If T µ • = (T µ • , f
) is the output of Construction 3.6, then we set α i to be the number of nodes of T µ • whose f -color is i, and we set α µ • = (α 1 , α 2 , . . . , α r ) for r the number of colors used by f . We now prove that the following map is well defined:

(11) Λ dyck : D • n → LAC n , µ • → (T µ • , α µ • ). Lemma 3.7.
At the end of the i-th step of Construction 3.6, the list L i of colors (renamed by first appearances in left-to-right traversal) is increasing. In particular, if u is a non-root node of T i and v is a descendant of u, then f i (u) < f i (v).

Proof. It follows from Construction 3.6 that the colors in the unique shortest path from the root of T i to v exactly coincide with the colors in L i from the beginning to the pointer, and they appear in the same order on that path and in L i . Now, suppose that there are two colors c 1 , c 2 such that c 1 is after c 2 in L i . Let u 1 be the first node in the LR-prefix order of T i with f i (u 1 ) = c 1 . There must be an ancestor u 2 of u 1 with f i (u 2 ) = c 2 by the argument in the first paragraph.

Since u 2 precedes u 1 in the LR-prefix order of T i , it follows that c 2 < c 1 due to the renaming. This yields f i (u 2 ) < f i (u 1 ) as desired.

Proposition 3.8. For a level-marked Dyck path µ • ∈ D • n with r marked north-steps, let (T, f ) be the colored tree obtained from Construction 3.6. The coloring f yields a composition α such that T is compatible with α.

Proof. We suppose that µ • has r marked north-steps. Let T µ • = (T, f ) be the colored tree obtained from µ • through Construction 3.6. It follows that f uses exactly r colors, and for i ∈ [r] we let α i be the number of nodes of T whose fcolor is i. Since every non-root node of T receives a unique color, it is clear that (α 1 , α 2 , . . . , α r ) is a composition of n.

For s ∈ [r], let T s be the restriction of T to the nodes of f -color at most s. We prove by induction on s that the induced subtree T s of T whose nodes are colored at the end of step s in Construction 1.4 is precisely T s .

The base case s = 0 is clear, since both T 0 and T 0 consist of a single root node. Now suppose that T s = T s . By Lemma 1.6(i), we see that T s+1 is connected. By Lemma 3.7, the f -color of any node is bigger than those of all its ancestors, so T s+1 is also connected. Now, let u be the last node with f (u) = s + 1 in the LR-prefix order of T. Consider a node v / ∈ T s that is a child of some node in T s = T s while strictly preceding u in LR-prefix order. Suppose that v is created in step i of Construction 3.6, with L i the list of colors (after renaming) available just after. Note that every ancestor of v has f -color at most s, so that u is in particular not an ancestor of v. Therefore, v comes after u in the right-to-left traversal of T, which means that s + 1 is already present in L i . The pointer of L i cannot be after s + 1, because that would imply the existence of an ancestor of v of f -color s + 1, which is a contradiction. The pointer of L i cannot be before s + 1, because otherwise by Lemma 3.7 we would have the contradiction s + 1 > f (v) > s because v / ∈ T s . It follows that f (v) = s + 1, which holds for all nodes of T s+1 \ T s that come before u in the LR-prefix order.

Since u is the last node in LR-prefix order that has f -color s + 1, no descendant of u belongs to T s+1 . Let X be the set of nodes in T s+1 \ T s . We have just shown that X contains all the nodes of T s+1 \ T s that precede u in LR-prefix order. Moreover, all nodes in X are active in the (s + 1)-st step of Construction 1.4. Since |X| = α s+1 , all the vertices in X receive color s + 1 in Construction 1.4. We conclude that T s+1 = T s+1 .

This completes the induction step, and we see that T is indeed compatible with α, and f is indeed the left-aligned coloring of T.

We conclude this subsection with the proof that Ξ dyck is a bijection whose inverse is Λ dyck . Theorem 3.9. For every positive integer n, the map Ξ dyck is a bijection whose inverse is Λ dyck .

Proof. In view of Propositions 3.5 and 3.8 it remains to show that Ξ dyck • Λ dyck = id and Λ dyck • Ξ dyck = id. We observe that the map Ξ dyck without markings and colors is a small twist of the well-known bijection from the set of plane rooted trees with n non-root nodes to the set of Dyck paths with 2n steps, described for instance in [START_REF] Deutsch | Dyck path enumeration[END_REF]Appendix E.1].

To show that Ξ dyck • Λ dyck = id, for µ • ∈ D • n , let (T, α) = Λ dyck (µ • ) and μ• = Ξ dyck (T, α) . As mentioned before, the underlying Dyck paths µ and μ are equal, so it remains to show that the marked north-steps are in the same positions. By construction, the marked north-steps of µ • determine the right-most nodes per color in (T, α), which in turn determine the marked north-steps in μ• in the same way. We conclude that µ

• = μ• . To show that Λ dyck • Ξ dyck = id, for (T, α) ∈ LAC n , let µ • = Ξ dyck (T, α) and (T , α ) = Λ dyck (µ • ).
As before, we conclude that T = T , and it remains to show that α = α . We observe already that α has the same number of parts as α , as both are equal to the number of marked north steps in µ • by construction.

Let T s , T s denote the subtrees of T and T , respectively, that consist of all nodes of color at most s, including the root. We show that T s = T s by induction on s. The base case s = 0 is clear, since both T 0 and T 0 consist of the root only. Now suppose that T s = T s . At least one of the active nodes of T s must belong to the set V of last nodes per color with respect to (T, α). We denote by u the first active node in V in the LR-prefix order of T. It follows that all active nodes of T s up to u in LR-prefix order receive color s + 1. The same reasoning works for T s as α and α have the same number of parts, and we conclude that T s+1 = T s+1 . This completes the induction step, and we have α = α .

THE STEEP-BOUNCE THEOREM

Recall the definitions of steep and bounce Dyck paths from Section 1.1.3. A pair (µ 1 , µ 2 ) of Dyck paths of the same length is nested if µ 1 always stays weakly below µ 2 . We denote by SP n the set of nested pairs (µ 1 , µ 2 ) such that µ 1 , µ 2 ∈ D n and the top path µ 2 is steep. We refer to the elements of SP n as steep pairs for simplicity. Similarly, we denote by BP n the set of nested pairs (µ 1 , µ 2 ) such that µ 1 , µ 2 ∈ D n and the bottom path µ 1 is bounce, and refer to its elements as bounce pairs.

The following construction encodes a level-marked Dyck path as a steep pair.

Construction 3.10 ([5, Section 2.2.3]). Given n > 0 and µ • ∈ D • n , we first take µ 1 ∈ D n the path obtained from µ • by forgetting the marking. We then construct a Dyck path µ 2 ∈ D n by forgetting the east-steps, replacing each marked north-step N • by a north-step N, and each unmarked north-step N • by a valley EN. We then append sufficiently many east-steps at the end of the so-created path to reach the coordinate (n, n). We return the pair (µ 1 , µ 2 ). Lemma 3.11. For a level-marked Dyck path µ • , the pair (µ 1 , µ 2 ) obtained by Construction 3.10 is a nested pair of Dyck paths, where µ 2 is steep.

Proof. The fact that µ 2 is steep and is weakly above µ 1 is immediate from the construction.

It follows from [5, Section 2.2.3] that the map [START_REF] Fang | The enumeration of generalized Tamari intervals[END_REF] φ : D

• n → SP n , µ • → (µ 1 , µ 2 ) is a bijection. Let (13) Ξ steep : LAC n → SP n , (T, α) → φ • Ξ dyck (T, α)
be the composition of the maps Ξ dyck and φ. Theorem 3.9 states that Ξ dyck is a bijection, which implies that Ξ steep is also a bijection. This map is illustrated in the right part of Figure 12, and also in the right part of Figure 13. We denote by Λ steep the inverse of Ξ steep .

Recall that for a fixed composition α, the map Ξ nn : T α → D α from ( 7) is a bijection between the set of α-trees and the set of α-Dyck paths. This map can be naturally extended to a map on the set of LAC trees considering all compositions simultaneously as follows: [START_REF] Adriano | A remarkable q, t-Catalan sequence and q-Lagrange inversion[END_REF] Ξ bounce : LAC n → BP n , (T, α) → ν α , Ξ nn (T) .

Remark 3.12. Although the maps Ξ nn and Ξ bounce are essentially the same, we assign them different names because they have different domains and codomains. On one hand, Ξ nn is defined on the set of plane rooted trees that are compatible with a fixed α (α-trees), and its image is the set of Dyck paths that lie weakly above a fixed bounce path ν α (α-Dyck paths). On the other hand, Ξ bounce is defined on the set of pairs (T, α) where T is an α-tree and α is a composition of n (LAC trees), and its image is the set of bounce pairs of the form (ν α , µ).

Theorem 1.32 states that Ξ nn is a bijection, which implies that Ξ bounce is also a bijection. Let Λ bounce be the inverse of Ξ bounce . The left part of Figure 13 illustrates the map Ξ bounce . We now define a bijection Γ by ( 15)

Γ = Ξ bounce • Λ steep
Γ def = Ξ bounce • Λ steep .
Note that Γ sends steep pairs to bounce pairs. We are now in the position to prove the first main result of this section.

Theorem III (The Steep-Bounce Theorem). For n > 0 and every r ∈ [n], the map Γ is a bijection from

• the set of nested pairs (µ 1 , µ 2 ) of Dyck paths with 2n steps, where µ 2 is a steep path ending with exactly r east-steps with y-coordinate equal to n, to • the set of nested pairs (µ 1 , µ 2 ) of Dyck paths with 2n steps, where µ 1 is a bounce path that touches the main diagonal r + 1 times.

Proof. Let (µ 1 , µ 2 ) ∈ SP n such that µ 2 ends with r consecutive east-steps, and (µ 1 , µ 2 ) = Γ(µ 1 , µ 2 ). It is clear that µ 1 touches the main diagonal precisely r + 1 times, since the parameter r describes precisely the number of colors in the LAC tree (T, α) that relates both pairs of Dyck paths.

We obtain a proof of [5, Conjecture 2.2.1] as a corollary. We refer the reader to [START_REF] Bergeron | Hopf Dreams and Diagonal Harmonics[END_REF] for any undefined terminology. Corollary 3.13 ([5, Conjecture 2.2.1]). The graded dimension of degree n of the Hopf algebra of the special family of pipe dreams considered in [5, Section 2.2] is equal to the number of walks in the quarter plane starting from the origin, ending on the x-axis, and consisting of 2n steps taken from the set (-1, 1), (1, -1), (0, 1) .

An illustration of the bijection Γ can be found in Figure 13; the correspondence between all LAC trees, bounce pairs and steep pairs for n = 3 is shown in Figure 14.

A NEW INTERPRETATION OF THE ZETA MAP

Somewhat surprisingly, the map Γ turns out to generalize the classical zeta map in q, t-Catalan combinatorics. Before specifying this connection, we briefly recall the history of the zeta map. Readers familiar with this topic may skip the following section and proceed directly to Section 3.3.3. 3.3.1. The Zeta Map. The classical zeta map is a certain bijection from D n onto itself. Its inverse was discovered in [START_REF] Andrews | Christian Krattenthaler, Luigi Orsina, and Paolo Papi, ad-nilpotent b-ideals in sl(n) having a fixed class of nilpotence: Combinatorics and enumeration[END_REF] in connection with nilpotent ideals in certain Borel subalgebras of sl(n). It later became an important map in the theory of diagonal harmonics and q, t-Catalan combinatorics [START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF].

One remarkable ingredient in this theory is a bivariate polynomial C n (q, t) which can be defined as the bigraded Hilbert series of the alternating component of a certain module of diagonal harmonics. Surprisingly, the dimension of that space is equal to the Catalan number c n def = 1 n+1 ( 2n n ), and therefore C n (q, t) is a polynomial with nonnegative integer coefficients whose evaluation at q = t = 1 recovers c n .

Intensive attempts to understand these polynomials led to important develomments [START_REF] Adriano | A proof of the q,t-Catalan positivity conjecture[END_REF][START_REF] Adriano | A remarkable q, t-Catalan sequence and q-Lagrange inversion[END_REF][START_REF] Haglund | Conjectured statistics for the q, t-Catalan numbers[END_REF][START_REF] Haiman | Vanishing theorems and character formulas for the Hilbert scheme of points in the plane[END_REF]. In particular, Haglund gave a combinatorial interpretation of the polynomial C n (q, t) in terms of a pair of statistics on Dyck paths known as area and bounce [START_REF] Haglund | Conjectured statistics for the q, t-Catalan numbers[END_REF]. Shortly thereafter, Haiman announced another combinatorial interpretation in terms of two statistics area and dinv. Unexpectedly, these two pairs of statistics were different but gave rise to the same expression:

(16) C n (q, t) = ∑ µ∈D n q area(µ) t bounce(µ) = ∑ µ∈D n q dinv(µ) t area(µ) .
The zeta map ζ is a bijection on D n that explains this phenomenon by sending the pair (area, dinv) to the pair (bounce, area).

Some Statistics on Dyck Paths.

Let us have a closer look at these statistics. First we need to describe how to obtain a steep and a bounce Dyck path from a given µ ∈ D n . Construction 3.14. Given n > 0 and µ ∈ D n , we construct a Dyck path µ bounce from µ as follows. We start at the origin and move north until we reach the last point that is still weakly below µ, and then move east until we hit the main diagonal. This process is repeated until we reach coordinate (n, n). It is clear that µ bounce ∈ D n is bounce, and we call it the bounce path of µ.

The bounce parameters of µ are the x-coordinates 0 = b 0 < b 1 < • • • < b r = n of the contact points of µ bounce and the main diagonal. We fashion these r -1 sequences together by interlacing the sequences a (k) and a (k+1) for all k ∈ [r -1], where we insert the values k -1 and k + 1 relative to the values k, and where we never put k -1 directly before k + 1. The resulting sequence a has precisely n entries, b k+1b k of which are equal to k for k ∈ {0, 1, . . . , r -1}. This construction is illustrated in Figure 16. Let T be a plane rooted tree with n non-root nodes. A node of T is of level k if its graph distance from the root is k + 1. In other words, the level of a node is its depth minus one. Let a(T) = (a 1 , a 2 , . . . , a n ) be the vector obtained by reading levels of each node according to the right-to-left traversal of T. We define an integer partition α T = (α 1 , α 2 , . . .) of n by setting α i to the number of nodes of level i + 1. It then follows immediately that T is α T -compatible. The pair (T, α T ) is a horizontal LAC tree. We have already seen a horizontal LAC tree in the middle of Figure 13. Lemma 3.19. For n > 0, the map Ξ steep restricts to a bijection from

• the set of horizontal LAC trees (T, α T ) where T has n non-root nodes, to

• the set of pairs (µ, µ steep ) where µ ∈ D n . Moreover, if (µ, µ steep ) = Ξ steep (T, α T ) , then a(µ) = a(T).
Proof. Recall that Ξ steep = φ • Ξ dyck . Given a horizontal LAC tree (T, α), let µ • = Ξ dyck (T, α) be the corresponding level-marked Dyck path, and (µ 1 , µ 2 ) = φ(µ • ) be the steep pair associated with µ • . We denote by a(µ 1 ) = (a 1 , a 2 , . . . , a n ) the area vector of µ 1 . We recall that µ 1 is the Dyck path obtained from µ • by forgetting the markings. The proof proceeds in three steps.

We first prove that a(µ 1 ) = a(T). Recall that µ 1 is obtained from the right-to-left traversal of T: upon each visit to a new node, we add a north-step; every time we go back up one level, we add an east-step. The contribution of a north-step to the area vector is equal to the number of north-steps preceding it minus the number of east-steps preceding it; this is clearly equal to the level of the corresponding node of the tree. Therefore, we have (we sum over all non-root nodes)

area(µ) = ∑ u∈T level(u) = ∑ u∈T ∑ v above u 1 = ∑ v∈T ∑ u below v 1 = r-1 ∑ i=1 (n -b i ) = bounce(ν).
The pairs contributing to dinv(µ) correspond to pairs of nodes (u, v) such that v comes before u in the right-to-left traversal of T and level(v)level(u) ∈ {0, 1}. Now, if we order the nodes in T first by increasing level, and then by occurrence in the right-to-left traversal, then each node can be identified with an integer between 1 and n. It follows that the cells below ν correspond precisely to the pairs contributing to dinv(µ), and we see that area(ν) = dinv(µ).

The Zeta Map on Parking Functions.

There is another generalization of the zeta map, due to Haglund and Loehr [START_REF] Haglund | A conjectured combinatorial formula for the Hilbert series for diagonal harmonics[END_REF], which we can obtain as a special case of a labeled version of our bijection Γ. Before going into the details, let us introduce some definitions.

A vertical labeling of a Dyck path µ ∈ D n is an assignment of the numbers from 1 through n to the boxes directly to the right of the north steps of µ such that the numbers are increasing from below in each column. The set Vert(D n ) of pairs (µ, P) where P is a vertical labeling of µ ∈ D n is commonly referred to as the set of parking functions of length n.

A diagonal labeling of a Dyck path ν ∈ D n is an assignment of the numbers from 1 through n to the boxes on the main diagonal such that, for every consecutive pair of steps EN of ν (valleys of ν), the number in the same column as the E step is smaller than the number in the same row as the N step. We denote by Diag(D n ) the set of pairs (ν, Q) where Q is a diagonal labeling of ν ∈ D n .

In [START_REF] Haglund | A conjectured combinatorial formula for the Hilbert series for diagonal harmonics[END_REF] [17, Conjecture 5.2], Haglund and Loehr conjectured two combinatorial interpretations of the bigraded Hilbert series of the module of diagonal harmonics:

DH n (q, t) = ∑ (µ,P)∈Vert(D n ) q dinv (µ,P) t area(µ) = ∑ (ν,Q)∈Diag(D n ) q area (ν,Q) t bounce(ν) ,
where dinv and area are generalizations of the dinv and area statistics that depend on the labelings P and Q. See [17, Chapter 5] for more details. Haglund and Loehr also provided a bijection

ζ : Vert(D n ) → Diag(D n )
that explains the equivalence of their two interpretations, and their conjecture follows from the more general statement of the shuffle conjecture [START_REF] Haglund | A combinatorial formula for the character of the diagonal coinvariants[END_REF], which was proven by Carlsson and Mellit in [START_REF] Carlsson | A proof of the shuffle conjecture[END_REF].

The map ζ is a straightforward generalization of the zeta map ζ. It is defined by

ζ(µ, P) def = ζ(µ), Q ,
where the order in which the labels in Q appear, in the north-east direction, is obtained by reading the labels in P along diagonals y = x + i, in the north-east direction, for i ∈ {0, 1, . . . , n -1} [17, Chapter 5]. 2 An example is illustrated in Figure 17.

Γ = Ξ bounce • Λ steep
We will show that ζ can be obtained in terms of a labeled version of our map Γ. Let T be a plane rooted tree with n non-root nodes. A right increasing labeling R of T is an assignment of the numbers from 1 though n to the non-root nodes of T that increases along right-most children, i.e. if v is the right-most child of u, then R(v) > R(u). We define a labeled horizontal LAC tree as a triple (T, α T , R) where (T, α T ) is a horizontal LAC tree and R is a right increasing labeling of T. We denote by LAC n the set of labeled horizontal LAC trees with n non-root nodes.

The restriction of the map Ξ steep from horizontal LAC trees to pairs of the form (µ, µ steep ) (as in Lemma 3.19) can be extended naturally in the context of labeled horizontal LAC trees. We denote by Vert( SP n ) the set of triples (µ, µ steep , P) where µ ∈ D n and P is a vertical labeling of µ. Let [START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF] Ξ steep : LAC n → Vert( SP n )

be the map that sends a labeled horizontal LAC tree (T, α T , R) to (µ, µ steep , P), where (µ, µ steep ) = Ξ steep (T, α T ) and P is obtained from R as follows: the nonroot nodes in T are in correspondence with the north steps of µ through the bijection Ξ steep , and we assign the labels of the non-root nodes in R to their corresponding north steps. Since the labels in T increase along right-most children, the resulting labeling of the north steps in µ is a vertical labeling. And vice-versa, every vertical labeling of µ arises uniquely from a labeling of T that increases along right-most children. As a consequence, the map Ξ steep is a bijection. We denote by Λ steep its inverse. Similarly, we also have a labeled version of the restriction of the map Ξ bounce from horizontal LAC trees to pairs of the form (ν bounce , ν) (as in Lemma 3.20). We denote by Diag( BP n ) the set of triples (ν bounce , ν, Q) where ν ∈ D n and Q is a diagonal labeling of ν. Let be the map that sends a labeled horizontal LAC tree (T, α T , R) to (ν bounce , ν, Q), where (ν bounce , ν) = Ξ bounce (T, α T ) and Q is obtained from R as follows: the labels in Q, from bottom to top, are obtained by reading from right-to-left the labels of non-root nodes of color i in T, for i ∈ {1, 2, . . .}. Since the valleys of ν are in correspondence with pairs of nodes (u, v) in T such that v is the right-most child of u, it is not hard to see that Q is a diagonal labeling of ν and that the map Ξ bounce is a bijection. We denote by Λ bounce its inverse. Finally, we denote by

(19) Γ : Vert( SP n ) → Diag( BP n ) the composition Γ = Ξ bounce • Λ steep .
As a consequence of Theorem IV and the discussion above, we get the following corollary.

Corollary 3.22. For n > 0, the map Γ is a bijection from • the set of triples (µ, µ steep , P) such that µ ∈ D n and P is a vertical labeling of µ, to • the set of triples (ν bounce , ν, Q) such that ν ∈ D n and Q is a diagonal labeling of ν. ) is a nested pair such that the top path µ 2 is steep and P is a vertical labeling of µ 1 . However, for the definition of diagonally labeled bounce pairs (ν 1 , ν 2 , Q), we need (ν 1 , ν 2 ) to be a nested pair such that the bottom path ν 1 is bounce as expected, but the requirement on the labeling Q depends on both ν 1 and ν 2 and is more involved.

Moreover, if (ν bounce , ν, Q) = Γ(µ, µ steep , P), then (ν, R) = ζ(µ, P),
Remark 3.24. Suppose that we remove the increasing condition in vertical labelings and the valley condition in diagonal labelings, but instead record as statistics the number of violations of these conditions, i.e. the number of descents from below to above along columns in vertical labelings, and the number of valleys with the entry below larger than the one above in diagonal labelings. Then our bijection Γ generalizes naturally to these labelings while transferring the two statistics from one to the other. It is because they are relayed by labeled LAC trees without the right increasing condition, and both statistics correspond to the number of nonroot nodes whose label is larger than that of its rightmost child. The zeta map for parking functions is simply the case where all these statistics are zero.

DISCUSSION

In this section we highlight some possible directions of future research.

Enumerative questions. From an enumerative point of view, Mishna and Rechnitzer found in [START_REF] Mishna | Two non-holonomic lattice walks in the quarter plane[END_REF] that the generating function of the lattice walks mentioned after Definition 3.2, which are in bijection with the level-marked Dyck paths, is not differentially algebraic with respect to the variable marking the end of the walk. This is an indication that the enumeration of these objects is complicated. It would be interesting to study the enumeration of certain sub-families with simple enumeration formulas.

Generalizations for other Coxeter groups. An intriguing follow-up question is to exhibit combinatorial models for the algebraic generalizations of parabolic 231avoiding permutations, parabolic nonnesting partitions, and parabolic noncrossing partitions to other Coxeter groups in [START_REF] Henri | Tamari lattices for parabolic quotients of the symmetric group[END_REF]Section 6]. Observe that these generalizations may depend on the choice of Coxeter element. These combinatorial models may then be used to generalize the other families described here accordingly. If such an extension is possible, it will hopefully lead to a Steep-Bounce zeta map in other types, which would possibly be related to the zeta map for irreducible crystallographic root systems described by Thiel in [START_REF] Thiel | From Anderson to zeta[END_REF].

Fuß-Catalan and rational Catalan generalizations. Another natural extension would be to consider Fuß-Catalan and rational Catalan objects. Is it possible to define an analogue of LAC trees in this world? If such an adaptation exists, we may define a Steep-Bounce map on Fuß-Catalan or even rational Catalan objects, therefore potentially generalize the zeta map in rational Catalan combinatorics.

Generalizations of the zeta map and statistics for multivariate diagonal harmonics. One of the most remarkable properties of the zeta map is that it describes combinatorial statistics for the Hilbert series of certain modules in diagonal harmonics. As mentioned by Armstrong, Loehr and Warrington in [START_REF] Armstrong | Sweep maps: A continuous family of sorting algorithms[END_REF], one point of view is that, rather than having two statistics area and dinv, we have only one statistic area and a nice map ζ. There are generalizations for multisets of variables that give rise to certain modules of multivariate diagonal harmonics [START_REF] Franc ¸ois Bergeron | Multivariate diagonal coinvariant spaces for complex reflection groups[END_REF]. One important and difficult problem in this area is to find combinatorial models and a multiset of combinatorial statistics to describe them. In the three variate case, these modules are closely related to intervals in the Tamari lattice. Two of the statistics have been conjectured in [START_REF] Franc ¸ois Bergeron | Higher trivariate diagonal harmonics via generalized Tamari posets[END_REF] but the third statistic is still missing. Furthermore, at the moment no generalization of the zeta map for Tamari intervals is known. Can the results in this paper be used to find the third missing statistic or a zeta map for intervals in the Tamari lattice? Can we push this forward for more sets of variables in connection to the results in [START_REF] Bergeron | Hopf Dreams and Diagonal Harmonics[END_REF]? A positive answer to these questions may lead to new understanding of multivariate diagonal harmonics. Two elements x, y ∈ P form a cover relation if x < y and there exists no z ∈ P with x < z < y. We write x y in this case, and say that x is a lower cover of y and that y is a upper cover of x.

A chain of P is a totally ordered subset of P. A chain is saturated if it can be written as a sequence of cover relations, and it is maximal if it is saturated and contains a minimal and a maximal element of P. The length of P is one less than the maximum cardinality of the maximal chains of P, and it is denoted by (P ).

The poset P is a lattice if for every x, y ∈ P there exists a least upper bound x ∨ y (the join of x and y), and a greatest lower bound x ∧ y (the meet of x and y). It follows that every finite lattice is bounded.

If P is a lattice, then an element j ∈ P \ { 0} is join irreducible if for every x, y ∈ P with j = x ∨ y we have j ∈ {x, y}. Dually, m ∈ P \ { 1} is meet irreducible if for every x, y ∈ P with m = x ∧ y we have m ∈ {x, y}. We denote the set of all joinirreducible elements of P by J (P ), and the set of all meet-irreducible elements of P by M(P ). Moreover, we observe that if P is finite, then every j ∈ J (P ) has a unique lower cover j * , and every m ∈ M(P ) has a unique upper cover m * . A.2. Extremal Lattices. Let L = (L, ≤) be a finite lattice. We follow [START_REF] Markowsky | Primes, irreducibles and extremal lattices[END_REF] and say that L is extremal if J (L) = (L) = M(L) . Extremal lattices admit a nice presentation as lattices that arise from certain directed graphs [START_REF] Markowsky | Primes, irreducibles and extremal lattices[END_REF], see also [START_REF]Rowmotion in slow motion[END_REF].

Suppose that L is extremal with (L) = n, and we choose a maximal chain C : x 0 x 1 • • • x n . We may totally order the join-and meet-irreducible elements of L as j 1 , j 2 , . . . , j n and m 1 , m 2 , . . . , m n such that

j 1 ∨ j 2 ∨ • • • ∨ j i = x i = m i+1 ∧ m i+2 ∧ • • • ∧ m n holds for all i ∈ [n].
From this order we may define a directed graph with vertex set [n], where we have a directed edge i → k if and only if i = k and j i ≤ m k . This graph is the Galois graph of L, denoted by Gal(L). Figure 18a shows an extremal lattice, and Figure 18b shows its Galois graph. The join-and meet-irreducible elements of the lattice in Figure 18a are labeled as described in the previous paragraph. We observe that this lattice has a unique maximal chain of maximum length. Now let G be a simple directed graph with vertex set [n] and edges i → k only if i > k. Two sets X, Y ⊆ [n] form an orthogonal pair if X ∩ Y = ∅ and there exists no edge i → k in G with i ∈ X and k ∈ Y. An orthogonal pair (X, Y) is maximal if whenever there exist Y ⊇ Y and X ⊇ X such that (X , Y ) is an orthogonal pair, then X = X and Y = Y. Let MO(G) denote the set of maximal orthogonal pairs of G.

For (X, Y), (X , Y ) ∈ MO(G) we declare (X, Y) (X , Y ) if X ⊆ X (or equivalently Y ⊇ Y ). It can be verified that L(G) def = MO(G), is a lattice, where the meet (X, Y) (X , Y ) is the unique maximal orthogonal pair (X ∩ X , Z) and the join (X, Y) (X , Y ) is the unique maximal orthogonal pair (Z, Y ∩ Y ). We have the following result.

Theorem A.1 [START_REF] Markowsky | Primes, irreducibles and extremal lattices[END_REF]Section 4]). If G is a simple directed graph on the vertex set [n] which has edges i → k only if i > k, then L(G) is an extremal lattice of length n. Conversely, every finite extremal lattice L is isomorphic to L Gal(L) .

The lattice of maximal orthogonal pairs of the directed graph in Figure 18b is shown in Figure 18c. In this figure, we have omitted set parentheses and commas for brevity.

Remark A.2. Let L, L be two extremal lattices with corresponding Galois graphs Gal(L), Gal(L ). If f : Gal(L) → Gal(L ) is an isomorphism of directed graphs, then it is clear that (X, Y) is a maximal orthogonal pair of Gal(L) if and only if f (X), f (Y) is a maximal orthogonal pair of Gal(L ). It follows that L Gal(L) ∼ = L Gal(L ) , and in view of Theorem A.1 we conclude that L ∼ = L .

Remark A.3. Observe that not every isomorphism of Galois graphs extends directly to an isomorphism of the corresponding extremal lattices. Consider for instance the pentagon lattice together with the bijection that swaps top and bottom and fixes everything else. This map is the identity on the Galois graph, but is not a lattice isomorphism.

A.3. Congruence-Uniform Lattices. Let us recall the following doubling construction due to Day [START_REF] Day | Characterizations of finite lattices that are bounded-homomorphic images or sublattices of free lattices[END_REF]. Let P = (P, ≤) be a finite poset. For X ⊆ P we define P ≤X def = {y ∈ P | y ≤ x for some x ∈ X}.

Let 2 denote the unique two-element lattice on the ground set {0, 1}. The doubling of P by X is the subposet of the direct product P × 2 induced by the set

P ≤X × {0} (P \ P ≤X ) ∪ X × {1} .
A lattice is congruence uniform if it can be constructed from the singleton lattice by a sequence of doublings by intervals [START_REF] Day | Characterizations of finite lattices that are bounded-homomorphic images or sublattices of free lattices[END_REF]Theorem 5.1]. Figure 19 shows an example of a congruence-uniform lattice and the sequence of doublings from which it is constructed.

If a congruence-uniform lattice is also extremal, then we can realize the corresponding Galois graph as a directed graph whose vertices are the join-irreducible elements.

Proposition A.4 ([25, Corollary 2.17]). Let L = (L, ≤) be an extremal, congruenceuniform lattice. The Galois graph of L is the directed graph whose vertex set is J (L), and which has a directed edge i → k if and only if i = k and k ≤ k * ∨ i. Let us illustrate that the construction in Proposition A.4 does not in general yield the Galois graph of an extremal lattice. Let L be the extremal lattice from Figure 18a. We can check that L is not congruence uniform. If we construct a directed graph on the join-irreducible elements of L according to the rules in Proposition A.4, we get the graph in Figure 20, which is not the same graph as Gal(L) shown in Figure 18b.

Conversely, the congruence-uniform lattice L on the right of Figure 19 is also extremal. The directed graph G(L) constructed according to the rules in Proposition A.4 is shown in Figure 21a. Figure 21b shows the lattice of maximal orthogonal pairs of G(L), which is isomorphic to L. This proves that G(L) is indeed (isomorphic to) the Galois graph of L. As an example, the map (a, b, c, d, e, f ) → (1, 2, 6, 4, 3, 5) realizes G(L) in Figure 21a as a graph that satisfies the conditions of Theorem A.1.

Figure 1 .

 1 Figure 1. An overview of the bijections presented in this article.

Figure 2 .

 2 Figure 2. Examples of α-trees, α-Dyck paths, (α, 231)-avoiding permutations and noncrossing α-partitions of size n = 3. Different columns correspond to different α's.

Figure 3 .

 3 Figure 3. An illustration of Construction 1.14 for α = (1, 3, 1, 2, 4, 3).

Figure 4 .

 4 Figure 4. An illustration of Construction 1.20 for α = (1, 3, 1, 2, 4, 3).

  which is a contradiction. We conclude that b 1 and b 2 are directly below bumps (a 1 , b 1 ) and (a 2 , b 2 ) respectively. Since v b 1 , v b 2 are active in the s-th step, it follows that a 1 , a 2 are in α-regions before the s-th α-region, with b 1 < b 1 and b 2 < b 2 . There are four possibilities.

  Suppose that a * = a. Let u * and v * denote the nodes of T that correspond to a * and b * . In particular, a * and b belong to different α-regions, which impliesC(u * ) < C(v). Since b < b * , we have C(v) ≤ C(v * ).By Construction 1.20, the node v * is the rightmost child of u * , and we conclude that b ≤ b * < b r . There are two cases. (i) If a < a * < b * < b r , then a and a * are in different α-regions by (NC2). Thus, C(u) < C(u * ), which means that v is active in the step in which u * receives its color in Construction 1.4. Since C(u * ) < C(v), it follows that u * precedes v in LRprefix order. Consequently, v * precedes v in LR-prefix order, too, as u * and v * are consecutive in LR-prefix order. But this implies b * < b, which is a contradiction. (ii) If a * < a < b * < b r , then either a and a * belong to the same α-region, or a and b * belong to the same α-region by (NC1). If a and a * belong to the same α-region, then it follows that C(u) = C(u * ) and that u * precedes u in LR-prefix order. Hence, v and v * become active in the same iteration of Construction 1.4 and v * precedes v in LR-prefix order, too. Thus, we have C(v * ) ≤ C(v), which by assumption yields C(v * ) = C(v). It follows that b and b * belong to the same α-region, and by Construction 1.20 we obtain that v precedes v * in LR-prefix order, which is a contradiction. If a and b * belong to the same α-region, then combining b < b * with the case condition, we have a < b < b * , and it follows that a and b also belong to the same α-region. This implies C

1. 2 . 5 .

 25 Dyck Paths and Left-Aligned Colorable Trees. The following construction associates an α-Dyck path with every α-tree. Construction 1.25. Given α = (α 1 , α 2 , . . . , α r ) an integer composition with |α|

Figure 5 .

 5 Figure 5. An illustration of Construction 1.25 for α = (1, 3, 1, 2, 4, 3).

  The parabolic Tamari lattice T (2,2,1) .

Theorem 2 . 2 ([ 25 ,

 2225 Theorem 1.3]). For every integer composition α, the parabolic Tamari lattice T α is extremal and congruence uniform.It follows from[START_REF] Henri M Ühle | Noncrossing partitions, Tamari lattices, and parabolic quotients of the symmetric group[END_REF] Corollary 4.5] that the join-irreducible elements of T α are precisely the (α, 231)-avoiding permutations with a unique descent. As a consequence of Proposition A.4, the Galois graph of T α (defined in Section A.2) can be realized as a directed graph whose vertices are pairs of integers. Let us make this more precise.

Theorem 2 . 3 (

 23 [START_REF] Henri M Ühle | Noncrossing partitions, Tamari lattices, and parabolic quotients of the symmetric group[END_REF] Theorem 1.8]). Let α be an integer composition. The Galois graph of T α is isomorphic to the directed graph with vertex set(a, b) | 1 ≤ a < b ≤ |α|and a, b belong to different α-regions , where there is a directed edge (a 1 , b 1 ) → (a 2 , b 2 ) if and only if (a 1 , b 1 ) = (a 2 , b 2 ) and • either a 1 and a 2 belong to the same α-region and a 1 ≤ a 2 < b 2 ≤ b 1 ,• or a 1 and a 2 belong to different α-regions and a 2 < a 1 < b 2 ≤ b 1 , where a 1 and b 2 belong to different α-regions, too.

Figure 6b illustrates this

  Figure 6b illustrates this result, and shows the Galois graph of T (2,2,1) . If α = (1, 1, . . . , 1) and n = |α|, then the classical Tamari lattice introduced in [30] is T n def = T (1,1,...,1) [6, Theorem 9.6(ii)]. 2.1.1. On the Duality of the Parabolic Tamari Lattices. We now show that reversing the composition α, produces a parabolic Tamari lattice which is dual to T α .Recall from Section 1.1 that, for an integer composition α = (α 1 , α 2 , . . . , α r ), the reverse composition is α = (α r , α r-1 , . . . , α 1 ).Moreover, for every n > 0, and every permutation w ∈ S n we define the reverse permutation w by settingw(i) = w(n + 1i) for i ∈ [n]. If w ∈ S α ,and we additionally reverse the order of the entries of each α-region of w, then we obtain a permutation w ∈ S α .For example, let w = 24|157|3|6 ∈ S (2,3,1,1) . Then we have w = 6375142, and w = 6|3|157|24 ∈ S (1,1,3,2) .

Figure 7 .

 7 Figure 7. The parabolic Tamari lattice T (1,2,2) .

Definition 2 . 8 .

 28 The poset T ν α def = D α , ≤ α is the ν α -Tamari lattice.

  (a) The ν (1,2,2) -Tamari lattice.

  The lattice of reduced ν (1,2,2) -bracket vectors.

Figure 11 .

 11 Figure 11. A cover relation in T α and the corresponding cover relation in T ν α for α = (1, 3, 1, 2, 4, 3).

Figure 12 .

 12 Figure 12. Example of left-aligned colorable trees, level-marked Dyck paths and steep pairs which are in bijection.

Figure 13 .

 13 Figure 13. An illustration of the Steep-Bounce zeta map Γ.

Figure 14 .

 14 Figure 14. The LAC trees, bounce pairs, and steep pairs of size n = 3.

1 P 2 P 3 Figure 16 .

 12316 Figure 16. An illustration of Construction 3.17.

Proposition 3 .

 3 18 ([17, Proof of Theorem 3.15]). For ν ∈ D n , the sequence a obtained by Construction 3.17 is the area-vector of some Dyck path µ ∈ D n , and we have µ = ζ -1 (ν).

3. 3 . 3 .

 33 The Steep-Bounce Zeta Map. In this section we prove Theorem IV, relating the zeta map ζ to our map Γ.

Figure 17 .

 17 Figure 17. An example of the ζ map from parking functions to diagonally labeled Dyck paths, computed in terms of the map Γ.

( 18 )

 18 Ξ bounce : LAC n → Diag( BP n ) 2 We are using the version of the ζ map described by Haglund in [17, Chapter 5], which differs from Haglund and Loehr's original description by just reversing the path ζ(µ) and the labels on the diagonal.

  The lattice of maximal orthogonal pairs of the graph in Figure18b.

Figure 18 .

 18 Figure 18. An extremal lattice with its associated Galois graph.

Figure 19 .

 19 Figure 19. A sequence of six interval doublings that yields a congruence-uniform lattice with twelve elements. At each step we double by the highlighted interval. Moreover, we have labeled the join-irreducible elements in the rightmost lattice.

Figure 20 .

 20 Figure 20. The graph of the lattice in Figure 18a constructed according to the rules in Proposition A.4.

  The Galois graph of the lattice on the right of Figure19.

  (-, abcde f ) (d, abc f ) (a, bcde f ) (ad, bc f ) (ab, cde f ) (acd, b) (ab f , cde) (abe, cd f ) (abe f , cd) (abde, c f ) (abde f , c) (abcde f , -) (b)The lattice of maximal orthogonal pairs of the graph in Figure21a.

Figure 21 .

 21 Figure 21. An illustration of Proposition A.4.

  can be extended to a partial order by taking the reflexive and transitive closure.We now define a binary relation R P on P by setting (P, P ) ∈ R P if and only if P starts below P. For every P ∈ NC α , the relation R P is acyclic.

	Lemma 1.9.

1.2.2. 231-Avoiding Permutations and Noncrossing Partitions. Recall that a binary relation R ⊆ M × M, for M a finite set, is acyclic if there does not exist a sequence (a 1 , a 2 ), (a 2 , a 3 ), . . . , (a k , a 1 ) ∈ R for any k > 0. It is well known that an acyclic relation

  P • . We may view P as a noncrossing α -partition of [n] \ P • for some appropriate composition α . By construction, we obtain O P by removing every pair of the form (P • , •) from O P . Let α be an integer composition, and let |α| = n. Let P ∈ NC α whose first block is P

	{5}	{12, 15}
	{2, 6}	{7, 8} {9, 13} {11, 14}
		3, 10}
	Construction 1.11.

Now let |α| = n, and P ∈ NC α whose first block is P • . Further, let P = P \

Example 1.12. Let

  and w P (i) < |D| + s -1 if i ∈ D \ P • . The initial condition for this recursion assigns the identity permutation to the α-partition without bumps. us continue Example 1.10. The first block of P is P • = {1, 3, 10}, and we see from the poset diagram above that D = {1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15}. Therefore we set w P (1) = 12, w P (3) = 11, and w P (10) = 10. The two smaller partitions are P 1 = {2, 6}, {5}, {7, 8}, {9, 13}, {12, 15} and P 2 = {4}, {11, 14} whose diagrams are shown below. Recursively, we obtain two permutations w 1 = w P 1 = 3 | 1 | 2 5 | 4 9 | 7 8 | 6 and w 2 = w P 2 = 1 | 3 | 2. We now embed these permutations into w P , where we have to increase the values of w 2 by |D| = 12. The resulting permutation is w P = 12 | 3 11 13 | 1 | 2 5 | 4 9 10 15 | 7 8 14 | 6.

	Two more examples of this construction are illustrated in the bottom part of
	Figure 11.
	Theorem 1.13 ([26, Theorem 4.2]). For P ∈ NC α the permutation w P is (α, 231)-
	avoiding. Moreover, the map
	(2)	Θ 2 : NC α → S α (231), P → w P
	is a bijection that sends bumps to descents.
	1.2.3. 231-

Avoiding Permutations and Left-Aligned Colorable Trees. The fol

  lowing construction associates a permutation in S α with an α-tree.

	Construction 1.14. Let α be an integer composition. Let T ∈ T α whose left-aligned
	coloring produced by Construction 1.4 is C.

By a "Catalan family" we mean a family of combinatorial objects enumerated by some Coxeter-Catalan numbers.

ACKNOWLEDGEMENTS

The authors thank Nantel Bergeron, Myrto Kallipoliti, Marni Mishna, Vincent Pilaud, and Robin Sulzgruber for inspiring discussions.

Cesar Ceballos was supported by the Austrian Science Foundation FWF, grant F 5008-N15, in the framework of the Special Research Program Algorithmic and Enumerative Combinatorics.

Wenjie Fang was supported by the Austrian Science Foundation FWF, grant P27290 and I2309.

1

Given n > 0 and µ ∈ D n , we construct a Dyck path µ steep from µ as follows. We start at the origin and move north until we reach the first point at which we can add an east-step while still remaining weakly above µ. We append this east-step, and repeat this process until we reach a lattice point with y-coordinate n. We add sufficiently many east-steps such that we end at (n, n).

It is clear that µ steep ∈ D n is steep, and we call it the steep path of µ.

Now for µ ∈ D n , its area vector a(µ) def = (a 1 , a 2 , . . . , a n ) is the integer vector whose i-th entry a i equals the number of unit boxes in row i that are below µ and above the main diagonal. Definition 3.16. Given µ ∈ D n with area vector a(µ) = (a 1 , a 2 , . . . , a n ) and bounce parameters b 0 , b 1 , . . . , b r , we define area, dinv, and bounce of µ, respectively, by area(µ

Figure 15 illustrates these statistics. We end this subsection by explicitly describing the inverse of the zeta map. We refer the reader to [START_REF] Andrews | Christian Krattenthaler, Luigi Orsina, and Paolo Papi, ad-nilpotent b-ideals in sl(n) having a fixed class of nilpotence: Combinatorics and enumeration[END_REF] and [START_REF]The q, t-Catalan Numbers and the Space of Diagonal Harmonics[END_REF]Proof of Theorem 3.15] for the original sources, and to [START_REF] Armstrong | Sweep maps: A continuous family of sorting algorithms[END_REF][START_REF] Ceballos | Combinatorics of the zeta map on rational Dyck paths[END_REF][START_REF] Thomas | Sweeping up zeta[END_REF] for further information on generalizations.

, the sequence a (k) arises from the subpath of ν between p k and p k+1 by replacing each east-step by k -1 and each north-step by k.

We now prove that (T, α) is a horizontal LAC tree if and only if µ • is such that the j-th north-step is marked if and only if a i < a j for all i < j.

Observe that for every µ ∈ D n there is a unique way to mark north-steps to satisfy the desired property. Moreover, every plane rooted tree T corresponds to a unique horizontal LAC-tree. Since the set of Dyck paths with 2n steps is in bijection with the the set of plane rooted trees with n non-root nodes [11, Appendix E.1], and the map Ξ dyck is a bijection, it remains to show that Ξ dyck assigns to every horizontal LAC tree a marked Dyck path with the desired property.

Let (T, α) be the horizontal LAC tree derived from T. The color of a node in T is equal to its level. In the right-to-left traversal of the tree, each time we reach the first node of a certain level, we get a marked north-step N • in µ • . All other nodes correspond to regular north-steps N • . Since a north-step contributes an entry to the area vector which is equal to the level of its corresponding node, the marked north-steps in µ • are exactly those that contribute an entry a j such that a i < a j for all i < j.

We finally prove that µ 2 is the steep path of µ 1 if and only if µ • is such that the j-th north-step is marked if and only if a i < a j for all i < j. This is straightforward in view of the following alternative description of the steep path of µ 1 . We parse µ 1 as follows. In the beginning, for each north-step we write down NE, until we reach one that contributes a 1 to the area vector of µ 1 , for which we write down NN. We then continue to append copies of NE until we reach a north-step that contributes a 2 to the area vector of µ 1 , for which we append NN again. We continue this process until a total of n letters N are written down, and we finish by adding the necessary number of letters E at the end.

The word so written corresponds to the steep path of µ 1 , and the valleys of (µ 1 ) steep correspond precisely to the entries a j of the area vector of µ 1 with a i < a j for all i < j. By Construction 3.10, the valleys of µ 2 correspond precisely to the marked north-steps of µ • .

These three claims together show that (T, α) is a horizontal LAC tree if and only if Ξ steep (T, α) is µ 1 , (µ 1 ) steep , and that a(T) = a(µ 1 ). Lemma 3.20. For n > 0, the map Λ bounce restricts to a bijection from

• the set of pairs (ν bounce , ν) where ν ∈ D n , to • the set of horizontal LAC trees (T, α T ) where T has n non-root nodes. Moreover, if (T, α T ) = Λ bounce (ν bounce , ν), then a ζ -1 (ν) = a(T).

Proof. Given a nested pair of Dyck paths (ν α , ν)

and that a k is the number of active nodes at the beginning of the (k + 1)-st step of Construction 1.4 (not to be confused with components α k in α). By definition, s 0 = 0, and a 0 is the number of children of the root. Since (T, α) is a horizontal LAC tree, we have a k = α k+1 . The proof proceeds in two steps.

We first show that (T, α) is a horizontal LAC tree if and only if ν α = ν bounce . We have already argued that the set of horizontal LAC trees with n non-root nodes is in bijection with the set of Dyck paths with 2n steps, and therefore also with the set of nested pairs of the form (ν bounce , ν) with ν ∈ D n . Thus, both sets have c n elements. In order to prove the claim, it thus suffices to show that (T, α) being a horizontal LAC tree implies ν α = ν bounce .

We already know that ν α lies weakly below ν, and we need to show that each peak of ν α touches the path ν at the initial point of an east-step of ν. Equivalently, we need to show that, for each k ∈ [r -1], the path ν has a valley with coordinates (p, q) such that s k-1 < p ≤ s k and q = s k . This valley corresponds to the rightmost internal node of color k, which is the i-th node of color k for some 1 ≤ i ≤ α k . Since T is a horizontal LAC tree, the rightmost child of this node is the rightmost node of color k + 1, which is the α k+1 -st active node in the k-th step of Construction 1.4. By definition of Ξ bounce , we see that

We now show that if (T, α) is a horizontal LAC tree, then a ζ -1 (ν) = a(T). Let µ = ζ -1 (ν) as described in Construction 3.17. The path ν bounce touches the diagonal at (0, 0) = (s 0 , s 0 ), (s 1 , s 1 ), . . . , (s r , s r ) = (n, n). Therefore, a(µ) has exactly s k+1s k = α k+1 entries equal to k for 0 ≤ k ≤ r -1, which is exactly the number of entries equal to k in a(T).

For 1 ≤ k ≤ r -1, we denote by a k (µ) and a k (T), respectively, the restrictions of a(µ) and a(T) to the values in {k -1, k}. It remains to show that a k (µ) = a k (T).

The vector a k (T) can be obtained from the right-to-left traversal of T: each time we reach a new node at level k -1 we add a value k -1 and each time we reach a new node at level k we add a value k.

The vector a k (µ) = a k ζ -1 (ν) can be obtained from the subpath of ν between (s k-1 , s k ) and (s k , s k+1 ) by replacing each east-step with k -1 and each north-step by k.

Recall that T = Λ nn (ν) as described in Construction 1.28. By Lemma 1.31, for 1 ≤ i ≤ s ks k-1 = α k , the number of north-steps in ν with x-coordinate s k-1 + i is equal to the number of children of the i-th node of color k in the right-to-left traversal of T. From this we deduce that a k (T) = a k (µ).

Theorem IV. For n > 0, the map Γ restricts to a bijection from

• the set of pairs (µ, µ steep ), where µ is a Dyck path with 2n steps, to

• the set of pairs (ν bounce , ν), where ν is a Dyck path with 2n steps. Moreover, if (ν bounce , ν) = Γ(µ, µ steep ), then ν = ζ(µ), where ζ is the zeta map from q, t-Catalan combinatorics.

Proof. By Lemmas 3.19 and 3.20, the map

Remark 3.21. We can also see Equation ( 16) combinatorially through our bijections. Let (T, α) be a horizontal LAC tree, with (µ, µ steep ) = Ξ steep (T, α) , and (ν α , ν) = Ξ bounce (T, α) . Since µ is simply Ξ dyck (T, α) without markings, we know that each north-step in µ corresponds to a non-root node in T, with the corresponding entry in the area vector a(µ) to be the level of that node.

APPENDIX A. LATTICE-THEORETIC BACKGROUND

In this appendix we provide some lattice-theoretic background that is important for the proof of Theorem II.

A.1. Basics. Let P = (P, ≤) be a finite partially ordered set (or poset for short). An element x ∈ P is minimal if for every y ∈ P with y ≤ x follows y = x. Dually, x is maximal if for every y ∈ P with x ≤ y follows x = y. Then, P is bounded if there exists a unique minimal and a unique maximal element, and we denote these bounds by 0 and 1, respectively.