Search arXivSearch

arXiv · 2605.29431

Rowmotion on hook and two-row alt $ν$-Tamari lattices

Abstract

In 2024, Ceballos and Chenevi{è}re introduced alt $ν$-Tamari lattices, parameterized by a lattice path $ν$ and an increment vector $δ$, as a common generalization of $ν$-Tamari and $ν$-Dyck lattices. We study rowmotion on two families: the alt hook-Tamari lattice $\mathsf{H}_δ(a,b)$ (where $ν=EN^{a-1}E^{b-1}N$) and the alt $2$-row-Tamari lattice $\mathsf{T}_δ(a,b)$ (where $ν=E^aNE^bN$). We explicitly determine the orbit structures of $\mathsf{H}_δ(a,b)$ and $\mathsf{T}_δ(a,b)$ under rowmotion, and prove that their orbit structures are independent of the increment vector $δ$. As a consequence, we show that rowmotion on $\mathsf{H}_δ(a,b)$ exhibits the cyclic sieving phenomenon. We also compute orbit sums for several natural statistics. In the hook case, we evaluate the down-degree, peak, valley, and area statistics; in the $2$-row case, we focus on the down-degree statistic. All of these -- except for the area statistic -- are homometric under rowmotion. Regarding the methodology of this paper, our results in the hook case are obtained by applying a simple local modification to their Hasse diagrams. In the $2$-row case, we introduce a switching property for semidistributive lattices, which allows us to compare the orbit structures arising from different increment vectors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sen-Peng Eu, Vei-Cheng Hioe, Yi-Lin Lee. 2026-05-28. Rowmotion on hook and two-row alt $ν$-Tamari lattices. https://arxiv.org/abs/2605.29431

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO