Smirnov Trees

We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is $e$-positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection.


Introduction
The study of permutation statistics has been an active area of research since the seminal work of MacMahon [9]. A particular permutation statistic that plays a prominent role in algebraic combinatorics is the descent statistic. The associated integer sequence obtained by counting permutations according to their number of descents is the well-known sequence of Eulerian numbers. Rather than giving an exhaustive list of areas in mathematics where this sequence makes an appearance, we refer the reader to [11] for a beautiful book exposition.
Given that permutations may be considered to be linear trees, it is natural to consider generalizations of classical permutation statistics in the context of labeled plane binary trees.
Gessel [6] was the first to study the analogue of the descent statistic for labeled binary trees, and he further pointed out intriguing connections to the enumerative theory of Coxeter arrangements. There has been a flurry of activity towards understanding these connections better, and the reader is referred to [2,3,4,7,19,20] for more details. Gessel-Griffin-Tewari [7] investigated these connections from the perspective of symmetric functions; they attach a multivariate generating function tracking ascent-descents over all labeled binary trees and subsequently prove that this generating function expands positively in terms of ribbon Schur functions. This result is part of the motivation for our article. The rest of it stems from recent work of Shareshian-Wachs [13] on chromatic quasisymmetric functions, which we discuss next.
Stanley [16] introduced chromatic symmetric functions of graphs as a way to generalize chromatic polynomials of graphs. In the case where the graph has n nodes and no edges, the chromatic polynomial is the sum of x w where w ranges over all words of length n.
Here, and throughout the rest of this article, set x w := x w 1 · · · x wn if w = w 1 . . . w n , where x = {x 1 , x 2 , . . . } is an alphabet with commuting indeterminates. It is worth remarking that the refined version tracking the distribution of descents over the set of all words of length n is ribbon Schur-positive. This motivates studying an analogue of the descent statistic for general graphs in tandem with the chromatic symmetric function, and this was done by Shareshian and Wachs in [13], wherein they introduced chromatic quasisymmetric functions. In the special case where the underlying graph is a path on n nodes, the chromatic quasisymmetric function tracks descents in Smirnov words of length n, i.e. words where two adjacent letters are distinct. More importantly, in contrast to the ribbon-positivity in the case where the graph was completely disconnected, the chromatic quasisymmetric function of the path graph is e-positive, i.e. it can be expressed as a non-negative integer linear combination of elementary symmetric functions. This raises the following natural questions: (1) Is there an analogue of Smirnov words and the descent statistic in the context of labeled binary trees? (2) If yes, is the generating function tracking the distribution of descents e-positive?
In this article, we provide answers to both these questions in the positive by introducing Smirnov trees -labeled rooted plane binary trees with the property that if the parent has the same label as one of its children, then the left child must have a larger label than the right child. Denote the set of all Smirnov trees by T . For any labeled binary tree T , let lasc(T ), ldes(T ), rasc(T ) and rdes(T ) denote the number of ascents and descents in the labeling to the left and right, such that rasc and lasc are determined by weak inequalities, whereas rdes and ldes are strict. See Subsection 2.2 for details. We associate a monomial x T with T as follows. For a node v ∈ T labeled i, let x v be x i . Then Consider the formal power series in x with coefficients in Q[ρ, ρ,λ, λ], It is not immediate that G is a symmetric function in x with coefficients in Q[ρ, ρ,λ, λ]. We establish the preceding fact via the following functional equation satisfied by G, which is also our first main result. Theorem 1.1. Let W n be the set of Smirnov words of length n. Then we have Theorem 1.1 follows from an intricate weight-preserving bijection between the sets n≥1 W n × (T ∪ {D, U }) n−1 and T , and this forms the technical crux of our article.
Let e n := e n (x) denote the n-th elementary symmetric function, and let E(z) := n≥0 e n z n . It is well known [13,Theorem C.4] that the generating function tracking ascents and descents over all Smirnov words is e-positive. This fact in conjunction with Theorem 1.1 implies the following theorem.
In fact, we provide a combinatorially explicit description for the coefficients in the basis of elementary symmetric functions. Additionally, we establish the following functional equation satisfied by G.
Outline of the article: In Section 2, we provide the necessary definitions for Smirnov words and Smirnov trees. In Section 3, we outline how we prove Theorem 1.1, how epositivity follows from the functional equation, and how to compute the coefficients in the e-expansion. We give a proof of Theorem 1.3 as well. Finally, in Section 4, we construct an intermediate bijection. The bijection that proves the main result is then the result of successive applications of this intermediate bijection. We provide many examples and a technical proof.
2.1. Words. Let N * denote the set of all words in the alphabet N. Given w = w 1 . . . w n ∈ N * , we call n the length of w. An index i ∈ [n − 1] is called a descent of w if w i > w i+1 and an ascent otherwise. We denote the set of descents (respectively ascents) of w by Des(w) (respectively Asc(w)) and denote |Des(w)| (respectively |Asc(w)|) by des(w) (respectively asc(w)).
A word w = w 1 . . . w n is a Smirnov word if adjacent letters are different, i.e. if w i = w i+1 for i ∈ [n−1]. The set of all Smirnov words is denoted by W and the set of all Smirnov words of length n by W n . Consider the multivariate generating function tracking the distribution of ascents and descents over W n Q n (s, t) = w∈Wn s asc(w) t des(w) x w , and let Q(z; s, t) := n≥0 Q n (s, t)z n .

Smirnov trees.
A plane binary tree is a rooted tree in which every node has at most two children, of which at most one is called a left child and at most one is called a right child . Henceforth, we simply say binary tree instead of plane binary tree. A labeled plane binary tree (or simply a labeled binary tree) is a binary tree whose nodes have labels drawn from N. We assign a weight to labeled binary trees as follows. An edge between a parent (resp. a left child) with label a and its right child (resp. its parent) with label b is weightedρ (resp.λ) if a ≤ b and ρ (resp. λ) if a > b. In other words, if the edge is between a parent and the right child, we use rho (for right), and if it is between a parent and its left child, we use lambda (for left). We add the bar if the nodes form a weak ascent when reading from left to right (either diagonally up or down). A node with label a has weight x a . The weight of a binary tree T , denoted by wt(T ), is the product of the weights of all its edges and nodes.
A labeled binary tree is called Smirnov if the following holds: • if the left (resp. right) child has the same label i as its parent, then the parent must also have a right (resp. left) child with label < i (resp. > i). In other words, if the parent has the same label as its child, the left child must have a larger label than the right child. Smirnov trees inherit a weight function from the one defined for ordinary labeled binary trees.
Denote the set of all Smirnov trees by T , and the set of all Smirnov trees whose root has label c by T c . If T ∈ T , define its principal path P(T ) as follows: it starts at the root; if the current node has no right child, stop; if the current node has a left child with the same label (and therefore a right child with a smaller label), move down left; otherwise, move down right. The last node on the principal path is called the principal node and is denoted α(T ); its label is a(T ). The maximal label on P(T ) is M(T ), and the minimal label is m(T ). Example 2.1. As an example, let T be the binary tree in Figure 1. There are two nodes with a child with the same label; in both cases, the parent has both children, and the left label is larger than the right label. Therefore T is Smirnov. In particular, T ∈ T 3 . The edges As mentioned in the introduction, we prove Theorem 1.1 by establishing a weight-preserving bijection between n≥1 W n × (T ∪ {D, U }) n−1 and T . We have already described how to assign weights to elements of the latter, so we proceed to describe weights assigned to elements of the former. For the sake of brevity, set Given a statement P , let [P ] equal 1 if P is true and 0 otherwise. If a, b are distinct positive integers and Y ∈ T ∪ {D, U }, define This given, consider (w, S) ∈ X , and let w := w 1 . . . w n and S := S 1 . . . S n−1 . The weight of (w, S), denoted by wt(w, S), is defined as follows.  Then we have Note that the right hand side in equation (2.1) is exactly the right hand side of the equality in Theorem 1.1. This explains why it suffices to exhibit a weight-preserving bijection between T and X in order to prove Theorem 1.1.

Bijection and applications
3.1. Outline of the bijection. Our weight-preserving bijection between T and X uses an intermediate bijection that we call Φ. Consider a triple (T, S, b), where S ∈ T ∪ {D, U } and b ∈ N is such that a(T ) = b. Recall that a(T ) is the label of the principal node of T . We assign a weight to (T, S, b) as follows: Our map Φ, whose precise description we postpone to Section 4, satisfies the following. The proof of Theorem 3.1, which is fairly involved, is also presented in Section 4. For the moment, we describe how Theorem 1.1 follows from Theorem 3.1, and subsequently we discuss various applications.
Proof. (of Theorem 1.1) By applying Φ successively, we construct a weight-preserving bijection Ψ : X −→ T , which proves our main theorem. If w ∈ W 1 , let Ψ(w, ∅) be the binary tree with a single node labeled w 1 . Here ∅ denotes the empty sequence. If n ≥ 2, w = w 1 · · · w n ∈ W n , We prove by induction on n that for w ∈ W n and S ∈ (T ∪ {D, U }) n−1 , Ψ(w, S) is well defined and a(Ψ(w, S)) = w n . For n = 1, this is obvious, and if it holds for n − 1, then a(Ψ(w , S )) = w n−1 = w n , so Φ(Ψ(w , S ), S n−1 , w n ) is well defined, and by Theorem 3.1, a(Φ(Ψ(w , S ), S n−1 , w n )) = w n . As far as the weight-preserving aspect of Ψ is concerned, note that In going from the first equality to the second, we have utilized the fact that Φ is a weightpreserving bijection. Induction along with a comparison of equations (3.1) and (3.2) implies that Ψ is weight preserving. Bijectivity of Ψ also follows from the bijectivity of Φ.
3.2. e-positivity and bleeding trees. To write an explicit expression for Q n (s, t), we invoke [13,Theorem C.4] which states that the generating function for Smirnov words of length n is e-positive. More precisely, Shareshian and Wachs prove that where [a] t = 1 + t + · · · + t a−1 for a ∈ N. For example, it is easy to check that which agrees with the formula.

It immediately follows from equation (3.3) that
Our main result Theorem 1.1 states that the generating function for Smirnov trees satisfies the functional equation where s =ρλ G +ρ +λ, t = ρ λ G + ρ + λ. From equations (3.4) and (3.5), it follows that G is e-positive. Our goal is to describe c π = [e π ]G, the coefficient of e π in the e-expansion of G, for an arbitrary partition π. We will describe c π in terms of certain trees. For motivation, let us extract the coefficient at e 321 .
Among the terms in (3.5) (with s and t as above) there are and corresponding to compositions (k 1 , k 2 , k 3 ) = (2, 3, 2), (k 1 , k 2 , k 3 ) = (2, 2, 3). For every occurrence of s (resp. t), we can select eitherρλ G (resp. ρ λ G) orρ +λ (resp. ρ + λ). Of course, selecting a term with G means that the resulting symmetric function will have degree > 6, so the two terms contribute There are other terms in c 321 , however. For example, among the terms in (3.4) there is also e 32 · (s 2 + st + t 2 )(st), corresponding to the composition (k 1 , k 2 ) = (4, 2). Since e 321 = e 32 e 1 , the contribution of this term to c 321 is equal to the coefficient of e 1 in (s 2 + st + t 2 )(st). This is equal to The function e 1 in s · s + s · t + t · t comes from selecting one of the three summands, and then selecting e 1 from the first or the second term in the product. Therefore It is clear that c 1 , the coefficient of e 1 in G, is 1. We also have [1](st) = (ρ +λ)(ρ + λ), which gives further terms of c 321 .
We can distill the above reasoning into the following definition. Note that it follows from (3.4) that when extracting a coefficient of e π from some expression, we must pick a part of π that will play the role of k 1 . That is the meaning of red edges below.
Definition 3.2. A bleeding tree is an unordered rooted tree with the following properties: • nodes at even depth (including the root) are red and unlabeled, nodes at odd depth are black and labeled with positive integers • every red node has children, and it is connected with a red edge with exactly one of them; all other edges in the tree are black • if a black node is connected to its parent with a black edge, the number of children it has is less than or equal to its label, which cannot be 1; otherwise, it is strictly smaller than its label (in particular, it has no children if its label is 1). For a partition π, we denote by B π the (clearly finite) set of bleeding trees whose labels (with repetitions) are precisely the parts of π. We give black nodes weights. Assume that a black node has label r and k children.
• If the edge to its parent is black, its weight is • If the edge to its parent is red, its weight is The weight wt(U ) of a bleeding tree U is defined as the product of the weights of all its black nodes and the number of ways to draw a bleeding tree in the plane so that red edges always come first.
For example, the bleeding tree with one red node, three black nodes with labels 1, 2 and 3, and a red edge between the red node and the node with label 1 has weight 2p(1, 0)p(2, 0)p(3, 0), with the factor 2 coming from drawings 1 3 2 1 2 3 . Note that the requirement that a black node with a black edge to its parent cannot have label 1 is superfluous, as the weight of such a node would be the empty sum, i.e. 0. The requirement about the number of children being smaller than (or equal to) the label is also not needed, as the second binomial coefficient in the sums would be 0 in that case. In other words, given the weighting of trees, only the first two assumptions are necessary for a tree to be bleeding. All trees in B 321 are shown in Figure 3.
Given the straightforward yet cumbersome details of the induction, we omit the proof of the following.
While the equality in Theorem 1.3 is less transparent than Theorem 1.1, it immediately allows us to establish a result present in unpublished work of Gessel, and then proved in [8] and [4]. We call a labeled binary tree on n nodes standard if the labels are all distinct and drawn from [n]. Note that a standard labeled binary trees is necessarily Smirnov. Gessel considered the following generating function that tracks the distributions of ascents and descents over standard labeled binary trees: Consider the homomorphism ex from the ring of symmetric functions to Q[[x]] defined by setting ex(e n ) = x n n! for n ∈ N. A key property of ex is the following. Given a symmetric function f , we have [x 1 · · · x n ]f = [ x n n! ]ex(f ). It follows that ex(G) = B, and we obtain the following corollary.  The map Φ is illustrated in Figure 4, and the formal definition is as follows.
then Φ(T, S, b) is the tree we obtain if we add a right child β with label b to α. If S = D, β has no children, and if S ∈ T c , β has S as its left subtree.
is the tree we obtain if we add a new root β with label b, and make T its left subtree. If S ∈ T c , we make S the right subtree of α.
is the tree we obtain if we replace the right subtree of δ with a new node β with label b; β has no right child, and its left subtree is the previous right subtree of δ. Furthermore, if S ∈ T c , we make S the right subtree of α.
is the tree we obtain if we replace the left subtree of δ with a new node β with label b; β has no right child, and its left subtree is the previous left subtree of δ. Furthermore, if S ∈ T c , we make S the right subtree of α.
is the tree we obtain if we replace the left subtree of δ with its right subtree, and its right subtree with a new node β with label b; β has no right child, and its left subtree is the previous left subtree of δ. Furthermore, if S ∈ T c , we make S the right subtree of α. Let us illustrate the simplest rule, rule 1. See Figure 5. We take the same tree T for all four examples, with the principal node α = α(T ) being the left child of the right child of the root, and a = a(T ) = 3 (again, the principal node is gray). By definition, b cannot equal 3. If S = D, we simply add a right child to α, with label b. The weight of T is multiplied by x b and, if a < b (resp. a > b), byλ (resp. λ); the edge that contributes this weight is red. The situation is similar if S is a tree with root label c, and b is either larger or smaller than both a and c. In that case, add a right child with label b to α, and this right child has S as its left subtree (light gray). The weight of T is multiplied by x b , wt(S), andλρ (resp. λ ρ) if a < b (resp. a > b); the edges that contribute these weights are red. Note that in all three cases, the principal path is extended by one right step, and a(Φ(T, S, b)) = b. Let us present examples of rule 2, which is the only case when we produce a new root. See Figure 6. Again, we can take T to be the same tree throughout. If S = U , and either a < b and b is larger than all labels on the principal path (i.e. M < b), or a > b and b is smaller than all the labels on the principal path (i.e. m > b), create a new root with label b, with no right child, and with the entire T as its left subtree. The subcases 2c and 2d are similar. We have a tree S with root label c, and either a, M < b ≤ c or a, m > b ≥ c. In addition to the new root, we attach the tree S as the right subtree of α. The new root multiplies the weight of the tree by x b , and if S is a tree, the weight is multiplied by wt(S). Furthermore, the edge to the new root addsλ if a > b and λ if a < b; if S is a tree, the edge between α and its new right child adds the weightρ if a > b and ρ if a < b.  Figure 6. An illustration of rule 2.
For rule 3, let us take a slightly larger example; note that the T 's Figure 7 differ only in the root label. Unlike in rule 2, there is a label on the principal path that is ≥ b if a < b and ≤ b if a > b. Recall that δ is the last node on the principal path with that property (the root in all our four examples), with label d. The crucial assumption now is that d = b. If S is a tree, its root label must be ≥ b if a < b and ≤ b if a > b (since otherwise we would use rule 1). Now break up the tree: add a new node β as the right child of δ. The new node has no right child, and its left subtree is the old right subtree of δ. Again, if S is a tree, add it as the right subtree of α.  Figure 8. An illustration of rules 4 and 5.
As an example of the use of Ψ, consider the Smirnov word w = 42534242 ∈ W 8 and the sequence S = 1 , D, 2 , D, D, U, Then successive applications of Φ are depicted in Figure 9. The last tree obtained is T from the example for rule (5b), and S = S 7 and b = w 8 also match that example, so Ψ(w, S) is the Smirnov tree in Figure 10. The first case is when S = D. In that case, rule (1a) applies. Since a = b and the principal node α has no right child by definition, we can give it a right child β with label b. This creates a new right edge in the tree; if a < b, then its weight isρ, and if a > b, then its weight is ρ. In both cases, the weight of the new tree, which is clearly Smirnov, equals the weight of (T, S, b), which isρ wt(T )x b or ρ wt(T )x b , depending on whether a < b or a > b. It is also clear that the principal path is the same as before with an added right step at the end. So the new principal node has label b, as claimed. Note that in case (1a), the new principal node has no children, and its left parent has a different label. (Statements in italics will be crucial in the construction of the inverse of Φ.)  Figure 10. The Smirnov tree corresponding to w = 42534242 and S as in (4.1). Now assume that S = U and a < b. The principal path contains a node with label < b, and either M , the maximum of all labels on the principal path, is < b, or it is ≥ b. The first case gives rule (2a). Indeed, since M < b, the root label is also < b. When we add a new root β with label b and make T its left subtree, we create a new edge with weightλ, so the weight changes as claimed. The new tree is also obviously Smirnov. The principal path contains only the root, and the new principal node again has label b. Note that in case (2a), the root of the new tree is the principal node with a left child, and all the labels on the principal path of its left subtree are smaller than the root label. The next case is when S = U , a < b, and M ≥ b. On the principal path, there is at least one node with label at least b. Let δ be the last node on the principal path with that property, and let d ≥ b be its label. The children of δ must have a label different from d (otherwise, the node after δ on the principal path is its child with the same label, and therefore δ is not the last node on the principal path with label ≥ b). That means that the principal path goes right from δ. Again, we have two options, d > b and d = b. The first case gives rule (3a). Since d = b, we can replace the right child of δ with a new node β with label b, and make the old right subtree of δ the left subtree of the new node (which has no right child).
Since d > b, the edge between δ and its new right child has label ρ; since all the labels on the principal path of the right subtree of δ in T are < b by the selection of δ, the old edge between δ and its right child had weight ρ, and the new edge between β and its left child has labelλ. In other words, the weight of the new tree is the previous weight timesλ x b , as required. Also, the new principal path again ends at β, which has label b. Note that in case (3a), the new principal node is a right child whose parent has a larger label, and all the labels on the principal path of its (nonempty) left subtree are smaller.
The other option is that S = U , a < b, M ≥ b, and d = b. This gives rule (4a): we insert a new node β with label b on the edge between δ and its left child (if δ has no left child, we just add a left child with label b). Since the right child of δ has label < b, and the left child of δ has label = d, the new tree is Smirnov. We added an edge between β and δ, which has, since both have labels b, weightλ. The new principal path now goes to the left after δ, and stops there. The label of the new principal node is b. Note that in case (4a), the new principal node is a left child, and its label is larger than all the labels on the principal path of its parent's (nonempty) right subtree. This completes the analysis of the case S = U , a < b. The analysis for S = U , a > b is similar (the major difference being in the case d = b) and we will provide fewer details. The principal path contains a node with label > b, and m, the minimum of all labels on the principal path, can be > b or ≤ b. The first case gives rule (2b): add a new root, and make T its left subtree. The new edge has label λ, so the weight changes as required. Note that in case (2b), the root is the principal node, and all the labels on the principal path of its (nonempty) left subtree are larger than the root label. If S = U , a > b, and m ≤ b. On the principal path, there is at least one node with label at most b. Let δ be the last node on the principal path with that property, and let d ≤ b be its label. Again, the children of δ must have a label different from d, and that means that the principal path goes right from δ. Again, we have two options, d < b and d = b. The first case gives rule (3b). Replace the right child of δ with a new node β with label b, and make the old right subtree of δ the left subtree of the new node (which has no right child).
The new tree is Smirnov and its weight is the previous weight times λ x b . The new principal path again ends at β, which has label b. Note that in case (3b), the new principal node is a right child whose parent has a smaller label, and all the labels on the principal path of its (nonempty) left subtree are larger.
On the other hand, if S = U , a > b, m ≤ b, and d = b, we have rule (5a). We insert a new node β with label b as a right child of δ (not left child as in case (4a)!), make its left subtree the old left subtree of δ, and make the old right subtree of δ its left subtree. Since the root of the old right subtree of δ has label > b, this is still a Smirnov tree. The difference in weights comes from the edge between δ and its new left child, which has weight λ, and, as always, from the new node β. The new principal path ends at β. Note that in case (5a), the new principal node is a right child, and its label is the same as its parent's label and smaller than all the labels on the principal path of its parent's (nonempty) left subtree. The new principal node might have no children (if δ had no left child in T ). This leaves us with the case when S is a tree with, say, root label c. The analysis is similar and we will be brief. The first case is when c is "on the same side" of b as a, i.e. if a, c < b (use (1b)) or a, c > b (use (1c)). Apart from adding the new node β as the right child of α, we also add the tree S as the left subtree of β. If a < b, the new edges have weightsρ andλ, and if a > b, the weights are ρ and λ. Of course, we also added the tree S, which contributes wt(S) to the weight of the new tree. Thus in both cases, the weight of the new tree equals wt(T, S, b), and the new principal node is β. Note that in case (1b), the new principal node is a right child and has a left child, and its label is larger than the labels of its parent and its left child. In case 1c, the new principal node is a right child and has a left child, and its label is smaller than the labels of its parent and its left child. Otherwise, c is "on the other side" of b as a: we have either a < b ≤ c or a > b ≥ c. Let us assume that a < b ≤ c. Again, we look at the labels on the principal path of T . If they are all smaller than b, we have case (2c). Apart from adding the new root and making T its left subtree, we also add S as the right subtree of α. The new edges have weightsλ (since the principal label is < b) andρ (since a < c), which ensures that the weight of the new tree is wt(T, S, b). Note that in case (2c), the root is the principal node, its label is larger than the label of its left child, but there is a node on the principal path of its left subtree (the root of S!) that has a label at least as large.
We can also have nodes on the principal path that have labels ≥ b. Again, let δ be the last such node, and let d ≥ b be its label (different from the nodes of δ's children). If d > b, we have rule (3c): do the same as in case (3a), but also add the tree S as the right subtree of α. In case (3c), the new principal node is a right child whose parent has a larger label, the left child has a smaller label, and there is a node on the principal path of its left subtree with a label that is at least as large.
If, however, d = b, we are in case (4b), which is similar to (4a). In case (4b), the new principal node is a left child and its label is larger than the label of its parent's right child, but there is a label on the principal path of its parent's right subtree with a label that is at least as large. This leaves us with the analysis of the cases when S ∈ T c and a > b ≥ c. If m > b, we have case (2d), which has the same construction as (2c), but new edge weights λ and ρ instead of λ andρ. Of course, this is consistent with the requirement that a > b, S ∈ T adds weight λ ρ w(S)x b . In case (2d), the root is the principal node, its label is smaller than the label of its left child, but there is a node on the principal path of its left subtree that has a label at most as large.
If m ≤ b and d < b, we have case (3d). Again, do the same thing as in case (3c). Note that in case (3d), the new principal node is a right child whose parent has a smaller label, the left child has a larger label, and there is a node on the principal path of its left subtree with a label that is at most as large.
Finally, consider the case m ≤ b, d = b, which is rule (5b). The situation is similar as in (5a), except that we add the tree S as the right child of α. In case (5b), the new principal node is a right child, its label is the same as its parent's label and smaller than the label of its parent's left child, but there is a label on the principal path of its parent's left subtree with a label that is at most as large. The new principal node might not have children.
This concludes the proof that Φ is a well-defined weight-preserving map. The proof is finished if we construct the inverse. The detailed analysis of the previous paragraphs makes that easy. We are given a tree T with at least two nodes, and we want to see that there is a unique triple (T, S, b) with Φ(T, S, b) = T . Clearly, b must be a(T ); denote α(T ) by β.
As the principal node, β cannot have a right child. Let us first assume that it has no parent, i.e. that it is the root of T . Since T is not a single node, it must have a nonempty left subtree T . We obtain T by applying one of the two rules to T or to T with a subtree removed. More precisely, if all the labels on the principal path of the left subtree of the root are smaller (resp. larger) than b, then T = Φ(T, U, b) is the result of rule (2a) (resp. (2b)). If, however, the left child of the root has a label that is smaller (resp. larger) than b, but there is a node on the principal path of T whose label is ≥ b (resp. ≤ b), denote the first such node γ. Then we obtain T by applying rule (2c) (resp. (2d)) to (T \ S, S, b), where S is the subtree of T with root γ. Now assume that β is not a root. The first case is that it is a left child. By construction of the principal path and the fact that T is Smirnov, that must mean that its parent's label is also b, and that the parent has a right child with a smaller label. If all the labels on the principal path of β's parent's right subtree are smaller than b, we obtain T by applying rule (4a) to (T, U, b), where T is obtained from T by deleting the node β (if β has a left subtree, simply make this subtree β's parent's left subtree). If, on the other hand, γ is the first node on the principal path of β's parent's right subtree with label ≥ b and S is the subtree of T with root γ, then T = Φ(T \ S, S, b).
The last (and most common, as the principal path prefers the right direction) case is when β is the right child. The first case is when its parent's label is also b. That must necessarily mean that β's parent has a left child with label > b. If all the labels on the principal path of β's parent's left subtree are > b, we obtain T as an application of rule (5a) to (T, U, b), where T is the tree we obtain if we remove β and swap the resulting left and right trees of β's parent. Otherwise, T results by using rule (5b). Now we can assume that β is the right child, and its parent has a different label. If β has no children, we can produce it by using rule (1a) on (T \ {β}, D, b). If β has a left child, it will necessarily have a different label. If the labels of β's parent and child are both smaller than b, T is obtained by rule (1b), and if they are both larger than b, by rule (1c). That leaves us with the case when one of the labels is larger and the other one is smaller. If the parent's label is larger (resp. smaller) and all the labels on the principal path of β's left subtree are smaller (resp. larger), we applied rule (3a) (resp. (3b)) to get T . If, however, the parent's label is larger (resp. smaller), the left child's label is smaller (resp. larger), but there is a node on the principal path of β's child whose label is at least b (resp. at most b), we applied rule (3c) (resp. (3d)). This completes the construction of the inverse, and the proof of the theorem.
A suggested exercise for the reader is to take the tree drawn just before the proof and reproduce the word w and the sequence S.

Final remarks
(1) As mentioned in the introduction, Smirnov words can be interpreted as proper colorings of path graphs. Smirnov trees, on the other hand, are a labeled tree-analogue of Smirnov words. This raises the natural question of constructing labeled (binary) tree analogues for graphs other than path graphs, and see if one can define ascent-descent statistics on these tree analogues that relate to the Shareshian-Wachs chromatic quasisymmetric function. Another potential avenue is to consider the directed or cyclic analogue of the aforementioned question given the recent work of Ellzey-Wachs [5] and Panova-Alexandersson [10]. where Cat n denotes the nth Catalan number. It is unclear to us how one could derive these equalities starting from our e-positive expansion for G in terms of weights of bleeding trees.
The h-positivity of ωG (here ω is the standard involution on the algebra of symmetric functions) raises the question of constructing a natural permutation representation that realizes ωG as its Frobenius characteristic. Stanley [15,Proposition 7.7], using a recurrence due to Procesi [12], established that ωG(ρ, ρ, 0, 0) can be realized as the generating function of the Frobenius characteristic of the representation of S n on the cohomology of the toric variety associated with the Coxeter complex of type A n−1 .
Stembridge [18] also constructed a symmetric group representation which realizes ωG(ρ, ρ, 0, 0) as the Frobenius characteristic via a bijection from permutations to what he calls codes. It would be interesting to generalize these results to Smirnov trees.
The following are the characters that such permutation representations would have. For example, there are 288 standard trees on five nodes that have weightρ 2λ λ (i.e., that have two right ascents, one left ascent and one left descent). According to line 7 of the last table, 94 of them should be fixed under the action of a transposition, 8 under the action of a 4-cycle etc.