Hierarchical Lattice Structures in Grid-Tamari Orders

• Hierarchical lattice structure is a nested order-theoretic framework where local non-kissing path combinatorics form a poset that becomes a congruence-uniform lattice through biclosed sets and quotienting.
• It unifies classical Tamari, type A Cambrian, and Grassmann-Tamari orders by leveraging closure operators on grid-derived segments to construct a larger, regular lattice.
• The approach demonstrates that complex local combinatorial rules can induce robust global properties such as well-defined joins, meets, and controlled lattice congruences.

In algebraic combinatorics, a hierarchical lattice structure can denote a nested order-theoretic organization in which local combinatorics first produces a poset, that poset is then realized as a quotient of a larger lattice, and the quotient inherits strong lattice-theoretic properties. In the setting of Grid-Tamari orders, this phrase refers to the passage from non-kissing paths on a finite grid shape $\lambda$, to a poset on facets of the non-kissing complex, to a lattice of biclosed sets, and finally to the identification

$\GT(\lambda)\cong \Bic(S)/\Theta,$

from which congruence-uniformity follows (McConville, 2015).

1. Order-theoretic meaning of the hierarchy

The foundational model is the classical Tamari order, the poset on proper bracketings of a word whose covering relations are generated by the associativity move

$((ab)c)\lessdot (a(bc)).$

The Tamari lattice is a central object in algebraic combinatorics and is known to be a congruence-uniform lattice. McConville studies a broader class, the Grid-Tamari orders $\GT(\lambda)$, defined for an arbitrary finite shape $\lambda$ cut from the square grid (McConville, 2015).

In this framework, the hierarchy consists of several nested levels. First, there is a poset structure on facets of the non-kissing complex $\Delta^{NK}(\lambda)$, obtained from an orientation of adjacency in the dual graph. Second, there is a larger lattice $\Bic(S)$ of biclosed sets of segments. Third, there is an explicit lattice congruence $\Theta$ on $\Bic(S)$. Fourth, the paper identifies

$\GT(\lambda)\cong \Bic(S)/\Theta.$

Consequently, $\GT(\lambda)\cong \Bic(S)/\Theta,$0 inherits congruence-uniformity from $\GT(\lambda)\cong \Bic(S)/\Theta,$1 (McConville, 2015).

This organization is hierarchical in a precise order-theoretic sense. The local path combinatorics does not merely define an ad hoc ordering; it sits inside a larger lattice-theoretic construction whose quotient structure explains why the resulting order has joins, meets, and well-controlled congruences.

2. Grid shapes, non-kissing paths, and the induced poset

A shape $\GT(\lambda)\cong \Bic(S)/\Theta,$2 is a finite induced subgraph of the $\GT(\lambda)\cong \Bic(S)/\Theta,$3 square grid. A vertex is interior if $\GT(\lambda)\cong \Bic(S)/\Theta,$4 contains the $\GT(\lambda)\cong \Bic(S)/\Theta,$5 grid centered at that vertex; otherwise it is a boundary vertex. A path supported by $\GT(\lambda)\cong \Bic(S)/\Theta,$6 is a sequence of vertices $\GT(\lambda)\cong \Bic(S)/\Theta,$7 such that $\GT(\lambda)\cong \Bic(S)/\Theta,$8 are boundary vertices, $\GT(\lambda)\cong \Bic(S)/\Theta,$9 are interior vertices, and each step moves one unit South or East. A segment is a path whose endpoints are both interior vertices (McConville, 2015).

Two paths are kissing if they share a common subpath $((ab)c)\lessdot (a(bc)).$0 such that one path enters $((ab)c)\lessdot (a(bc)).$1 from the West and leaves $((ab)c)\lessdot (a(bc)).$2 to the South, while the other enters $((ab)c)\lessdot (a(bc)).$3 from the North and leaves $((ab)c)\lessdot (a(bc)).$4 to the East. Otherwise they are non-kissing. The non-kissing complex $((ab)c)\lessdot (a(bc)).$5 is the simplicial complex whose faces are collections of pairwise non-kissing paths supported by $((ab)c)\lessdot (a(bc)).$6, and its facets are maximal non-kissing families of paths. The dual graph of this pure thin complex carries a natural orientation, and the transitive closure of that orientation is $((ab)c)\lessdot (a(bc)).$7 (McConville, 2015).

This construction unifies several familiar families.

Shape $((ab)c)\lessdot (a(bc)).$8	Resulting order
$((ab)c)\lessdot (a(bc)).$9 rectangle	usual Tamari lattice
suitable double-ribbon shapes	type $\GT(\lambda)$0 Cambrian lattices
$\GT(\lambda)$1 rectangle	Grassmann-Tamari orders $\GT(\lambda)$2

The significance of this level is that the combinatorics is genuinely local: paths, shared subpaths, and adjacency of facets determine the order. But the paper’s main contribution is to show that this local order already sits inside a more rigid lattice-theoretic architecture.

3. Biclosed sets and the larger ambient lattice

The proof proceeds by constructing a larger, simpler lattice of biclosed sets and then showing that $\GT(\lambda)$3 is a lattice quotient of it. Toward this goal, the paper defines a closure operator on sets of paths in a square grid and proves that the biclosed sets, ordered by inclusion, form a congruence-uniform lattice. In the detailed formulation, this ambient structure is described as a lattice of biclosed sets of segments $\GT(\lambda)$4 (McConville, 2015).

A lattice is a poset in which any two elements have a join $\GT(\lambda)$5 and meet $\GT(\lambda)$6. A quotient lattice $\GT(\lambda)$7 is formed from a lattice congruence $\GT(\lambda)$8, namely an equivalence relation compatible with joins and meets. A finite lattice is congruence-uniform if its congruences are controlled uniformly by join-irreducibles and meet-irreducibles; equivalently, by Day’s theorem, it is both semidistributive and congruence-normal (McConville, 2015).

The biclosed-set lattice is therefore not just a technical intermediate object. It provides a tractable order in which inclusion is the fundamental relation, while closure and biclosure encode the segment combinatorics in a form amenable to lattice theory. This suggests that the non-kissing path model is governed by a hidden closure system whose algebraic regularity is stronger than the original path description makes apparent.

4. Quotienting to the Grid-Tamari order

The central structural statement is that the Grid-Tamari order is a quotient lattice of the biclosed-set lattice: $\GT(\lambda)$9 This identifies the order on facets of $\lambda$0 with a congruence quotient of a larger congruence-uniform lattice (McConville, 2015).

The logic of the quotient construction is the crucial hierarchical step. The biclosed-set lattice supplies the ambient order-theoretic universe; the congruence $\lambda$1 collapses those biclosed sets that represent the same facet-level combinatorics; the quotient then recovers the facet order $\lambda$2. Because the quotient is taken in the category of lattices rather than posets, the resulting structure inherits lattice operations and congruence-theoretic regularity.

This point distinguishes the result from a purely combinatorial ordering on facets. The paper does not stop at showing that $\lambda$3 is a poset. It identifies the poset with a quotient lattice, thereby explaining why the order possesses a robust internal structure analogous to that of the classical Tamari lattice.

5. Congruence-uniformity and its consequences

The main theorem is that for any finite shape $\lambda$4, the associated Grid-Tamari order $\lambda$5 is a congruence-uniform lattice. This resolves a conjecture of Santos, Stump, and Welker (McConville, 2015).

Congruence-uniformity is a strong condition, stronger than merely being a lattice. In this setting, it means that the congruences of $\lambda$6 are controlled in a uniform way by join-irreducible and meet-irreducible elements, or equivalently that the lattice is both semidistributive and congruence-normal. The result therefore places Grid-Tamari orders in the same high-regularity class as the classical Tamari lattice (McConville, 2015).

The conceptual consequence is that the apparent complexity of non-kissing path combinatorics does not lead to a pathological order. On the contrary, once organized through biclosed sets and quotienting, it yields a lattice with a very strong global theory of congruences. This is the precise sense in which the lattice structure is hierarchical: coarse facet-level order is controlled by a finer biclosed-set level, and the finer level is itself governed by closure-theoretic regularity.

6. Scope, interpretation, and related clarifications

In this usage, “lattice” refers to an order-theoretic lattice, not merely to the underlying square grid on which the paths are drawn. The square grid provides the geometry of shapes, paths, and segments, but the principal object is the lattice structure on $\lambda$7 and its relation to $\lambda$8 (McConville, 2015).

It is also important that the hierarchy is not simply a matter of generalization from Tamari to larger families. The paper shows a specific structural chain: local non-kissing combinatorics induces a poset on facets; that poset is identified with a quotient of a biclosed-set lattice; and the quotient inherits congruence-uniformity. This makes the result simultaneously combinatorial, order-theoretic, and structural (McConville, 2015).

The inclusion of the usual Tamari lattice, type $\lambda$9 Cambrian lattices, and Grassmann-Tamari orders shows that Grid-Tamari orders are not an isolated construction. They unify several previously important families within one framework. A plausible implication is that the quotient-lattice viewpoint is not incidental to one example, but is part of a general mechanism by which path and segment combinatorics generate highly structured finite lattices.

7. Position within algebraic combinatorics

The Tamari order is described as a central object in algebraic combinatorics and many other areas. By extending from Tamari to Grid-Tamari orders and proving congruence-uniformity for the whole class, McConville’s work places non-kissing complexes and their facet orders within the core lattice-theoretic territory of the subject (McConville, 2015).

What makes the construction notable is the layered passage from geometry to order to lattice quotient. The shape $\Delta^{NK}(\lambda)$0 determines allowable South-East paths; non-kissing determines simplicial compatibility; facets and oriented adjacency determine a poset; biclosed sets provide an ambient congruence-uniform lattice; and the quotient recovers $\Delta^{NK}(\lambda)$1. The resulting object is therefore not only a generalization of Tamari-type orders, but also an explicit demonstration that local combinatorial constraints can induce a global congruence-uniform lattice structure.

In that sense, hierarchical lattice structure designates a nested architecture of combinatorial and order-theoretic levels whose culmination is the theorem that Grid-Tamari orders are congruence-uniform lattices. The phrase names the mechanism by which path-level data, closure operators, biclosed sets, and quotient congruences are assembled into a single coherent lattice-theoretic object (McConville, 2015).