---
title: T-POP in Tamari Lattices
url: https://www.emergentmind.com/topics/t-pop
type: topic
---

# T-POP in Tamari Lattices

“T-POP” (*Editor’s term*) denotes the specialization of Defant’s pop-stack-sorting operator to Tamari lattices, that is, the dynamics of \(\mathsf{Pop}_{\mathrm{Tam}_n}\) on the \(n\)-th Tamari lattice. Defant defined, for each complete meet-semilattice \(M\), the operator
\[
\mathsf{Pop}_M(x)=\bigwedge(\{y\in M: y\lessdot x\}\cup \{x\}),
\]
where \(\lessdot\) is the covering relation. In the Tamari setting, \(\mathrm{Tam}_n\) is the set of Dyck paths of semilength \(n\), or equivalently, 312-avoiding permutations under weak order, and the resulting dynamics connect Catalan structures, lattice-theoretic covers, pattern avoidance, and orbit enumeration. The central results are an explicit rational generating function for \(t\)-\(\mathsf{Pop}\)-sortable elements and the identification of the image of \(\mathsf{Pop}_{\mathrm{Tam}_n}\) with a Motzkin-number family [2201.10030].

## 1. Definition in the Tamari setting

For \(x\in \mathrm{Tam}_n\), the operator \(\mathsf{Pop}_{\mathrm{Tam}_n}(x)\) is the meet of \(x\) together with all elements it covers. The minimal element of \(\mathrm{Tam}_n\) is denoted \(\hat{0}\). An element \(x\in \mathrm{Tam}_n\) is called \(t\)-\(\mathsf{Pop}\)-sortable if
\[
\mathsf{Pop}_M^t(x)=\hat{0},
\]
and \(h_t(n)\) denotes the number of \(t\)-\(\mathsf{Pop}\)-sortable elements in \(\mathrm{Tam}_n\) [2201.10030].

This formulation places T-POP in the broader program of extending classical pop-stack sorting from the symmetric group to lattice-theoretic and Coxeter-theoretic settings. In the Tamari case, the operator is especially tractable because the lattice admits several interchangeable models—Dyck paths, 312-avoiding permutations, and bracket-vector encodings—which support explicit structural and enumerative analysis. A later generalization to ornamentation lattices shows that when the underlying rooted plane tree is an \(n\)-element chain, the ornamentation lattice is the \(n\)-th Tamari lattice, so the Tamari case is the basic linear instance of a larger family [2501.10311].

## 2. Enumeration of \(t\)-\(\mathsf{Pop}\)-sortable elements

The principal enumerative theorem gives an explicit rational generating function:
\[
\sum_{n\ge 1} h_t(n)z^n
=
\frac{z}{1 - 2z - \displaystyle\sum_{j=2}^{t} C_{j-1}z^{j}},
\]
where \(C_j\) is the \(j\)-th Catalan number. This verifies Defant’s conjecture that for fixed \(t\), the generating function is rational [2201.10030].

The significance of this formula is twofold. First, it identifies a closed-form rational structure in an iterated lattice-dynamical process that a priori need not have any such regularity. Second, it shows that the dependence on the iteration depth \(t\) is controlled by Catalan coefficients, reinforcing that the Tamari case is governed not merely by generic lattice theory but by the specific algebra of Catalan combinatorics. The theorem is not only an existence result: it gives a concrete series for the full family of counting sequences \(h_t(n)\).

A further structural ingredient is the decomposition of \(t\)-\(\mathsf{Pop}\)-sortable bracket vectors into irreducible components. If \(H_t(z)\) is the generating function for all \(t\)-\(\mathsf{Pop}\)-sortable elements and \(G_t(z)\) the generating function for irreducible ones, then
\[
1+H_t(z) = \frac{1}{1-G_t(z)}.
\]
This relation exposes the enumerative mechanism behind the rational formula: irreducibles behave as the primitive combinatorial units, and general elements assemble from them by a free-sequence type construction [2201.10030].

## 3. Image of the operator and Motzkin enumeration

A second main theorem concerns the image \(\mathsf{Pop}_{\mathrm{Tam}_n}(\mathrm{Tam}_n)\). The refined generating function is
\[
\mathsf{Pop}(\mathrm{Tam}_{n+1}; q) = \sum_{k=0}^n \frac{1}{k+1}\binom{2k}{k}\binom{n}{2k} q^{n-k}.
\]
At \(q=1\), the image size is a Motzkin number:
\[
|\mathsf{Pop}_{\mathrm{Tam}_n}(\mathrm{Tam}_n)| = M_{n-1}.
\]
This settles a conjecture of Defant and Williams identifying the image size with a fundamental integer sequence [2201.10030].

The structural characterization of the image is equally important. Under the isomorphism between \(\mathrm{Tam}_n\) and the lattice of 312-avoiding permutations under the right weak order, the image consists exactly of 312-avoiding permutations ending with \(n\) and with no double descents. The counting argument then passes through a reflection to 231-avoiding permutations and uses a known formula, attributed in the summary to Petersen, for permutations with \(k\) descents and \(k\) peaks:
\[
\frac{1}{k+1}\binom{2k}{k}\binom{n}{2k}.
\]

This result clarifies that the image is not an opaque subset produced by an iterative meet operation. It has a direct pattern-avoidance characterization and a classical combinatorial enumeration. In later work on ornamentation lattices, the image of \(\mathsf{Pop}\) and even the images of \(\mathsf{Pop}^k\) were further analyzed; for chains, this yields a complete characterization on Tamari lattices, and for \(k=1\) the resulting generating function gives Motzkin numbers, recovering and generalizing Hong’s Tamari result [2501.10311].

## 4. Proof architecture and combinatorial models

The original Tamari analysis proceeds by encoding Dyck paths as \(\nu\)-bracket vectors and describing the pop-stack operator explicitly through updates to these vectors. The argument then decomposes bracket vectors into irreducible components, derives generating-function recurrences for irreducible and general cases, and solves the resulting functional equations to obtain the rational formula for \(\sum_{n\ge 1} h_t(n)z^n\) [2201.10030].

For the image theorem, the proof uses the weak-order model of Tamari lattices together with lattice congruence machinery. The summary specifically invokes results of Reading and Björner–Wachs: 312-avoiding permutations form sublattices and can be described as minimal representatives of sylvester-congruence classes. This transfer from Tamari-lattice elements to pattern-avoiding permutations is what makes the image characterization tractable.

These methods illustrate a recurring feature of T-POP. Although the operator is defined purely in terms of meets and covers, the effective analysis is carried out in auxiliary combinatorial languages: bracket vectors for iteration, weak-order embeddings for image structure, and classical pattern-avoidance statistics for enumeration. The Tamari case is therefore a meeting point of semilattice dynamics and Catalan combinatorics rather than a purely order-theoretic curiosity.

## 5. Extensions beyond the original Tamari analysis

Subsequent work substantially broadened the T-POP perspective. The paper on ornamentation lattices studies the pop-stack operator \(\mathsf{Pop}\colon \mathcal{O}(\mathsf{T})\to\mathcal{O}(\mathsf{T})\) for a rooted plane tree \(\mathsf{T}\), where the ornamentation lattice of an \(n\)-element chain is the \(n\)-th Tamari lattice. It computes the maximum size of a forward orbit, characterizes the image of \(\mathsf{Pop}\), provides necessary conditions for membership in the image of \(\mathsf{Pop}^k\), and completely characterizes the image of \(\mathsf{Pop}^k\) on a Tamari lattice [2501.10311].

In that framework, the Tamari case appears as the linear prototype. The summary emphasizes several structural notions—minimal reductions, sections, beads, and hugs. A “no-hug” criterion generalizes Hong’s characterization of the image for Tamari lattices, while a beads condition controls iterated images. For chains, the paper gives a complete characterization and an explicit generating function for \(A_n^{(k)}=|\mathsf{Pop}^k(\mathcal{O}(C_n))|\); for \(k=0\) this is the Catalan generating function, and for \(k=1\) it gives Motzkin numbers [2501.10311].

A complementary line of work studies the image of \(\mathsf{Pop}_M\) on other lattices, including the weak order of type \(B_n\), the Tamari lattice of type \(B_n\), and the lattices of order ideals of the root posets of types \(A_n\) and \(B_n\). In each case the focus is the generating function
\[
\mathsf{Pop}(M; q)=\sum_{b \in \mathsf{Pop}_M(M)} q^{|\mathscr{U}_{M}(b)|},
\]
and the paper settles four conjectures of Defant and Williams on these images [2209.13695]. This suggests that the Tamari case is the most explicit member of a larger image-enumeration program for pop operators on structured lattices.

## 6. Related operators and terminological ambiguity

T-POP in the Tamari sense should be distinguished from the Coxeter pop-tsack torsing operator, denoted \(\mathsf{Pop}_T\), defined for a finite irreducible Coxeter group \(W\) with fixed Coxeter element \(c\) by
\[
\mathsf{Pop}_T(w)=w\cdot\pi_T(w)^{-1},
\]
where \(\pi_T(w)\) is the join in the noncrossing partition lattice of the reflections lying weakly below \(w\) in absolute order. This operator is a “Bessis dual” version of the Coxeter pop-stack sorting map rather than the Tamari-lattice operator itself [2106.05471].

Its dynamics differ sharply from those of T-POP on Tamari lattices. In coincidental types and type \(D\), the identity element is the unique periodic point of \(\mathsf{Pop}_T\), the maximum size of a forward orbit is the Coxeter number \(h\), and the forward orbit of \(c^{-1}\) has size \(h\) and is isolated in the sense that none of the non-identity elements of the orbit have preimages lying outside of the orbit [2106.05471]. A later paper resolves conjectures on enumerating elements with near-maximal orbit length and gives complete classifications in types \(A\), \(B\), and \(D\) [2209.11548].

There is also an unrelated modern use of the acronym in machine learning: “T-POP: Test-Time Personalization with Online Preference Feedback,” an algorithm for LLM personalization via test-time alignment and dueling bandits [2509.24696]. That usage is entirely separate from the Tamari-lattice literature. In combinatorics and lattice dynamics, T-POP is best understood as shorthand for the Tamari specialization of Defant’s pop-stack operator, centered on rational \(t\)-sortable enumeration, Motzkin-characterized images, and a growing web of generalizations across Catalan and Coxeter structures.

Source: https://www.emergentmind.com/topics/t-pop