Search arXiv⌕ Search

arXiv · 2611.10154

Bijecting $m$-Tamari intervals, trees, and tight gradings

Abstract

Tight gradings, which are certain integer gradings on maximal Dyck paths, provide a combinatorial framework for computing all coefficients of wall-functions in rank-$2$ cluster scattering diagrams. We construct a bijection between a special subset of tight gradings and the intervals of the $m$-Tamari lattice, providing a new combinatorial proof of the central wall-function formula proved by Reineke. Inspired by the structure of these gradings, we introduce a class of plane trees called $m$-leafy trees that give a new model for $m$-Tamari intervals. The defining condition of an $m$-leafy tree is simple: in every full subtree, the number of leaves is greater than $m$ times the number of internal vertices. The leafy tree perspective gives rise to a quadratic functional equation with a catalytic parameter, providing an alternative way to enumerate $m$-Tamari intervals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amanda Burcroff, Kyungyong Lee, Lang Mou. 2026-11-06. Bijecting $m$-Tamari intervals, trees, and tight gradings. https://arxiv.org/abs/2611.10154

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The finite volume method on Sierpiński simplices

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

math.CO↗

Absolute incidence theorems and tilings

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

math.CO↗

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO↗