Search arXivSearch

arXiv · 2508.09305

K-promotion on m-packed labelings of posets

Abstract

Schutzenberger's promotion operator, pro, is a fundamental map in dynamical algebraic combinatorics. At first, its action was mainly considered on standard Young tableaux. But pro was subsequently shown to have interesting properties when applied to natural labelings of other posets. Pechenik defined a K-theoretic version of promotion, pro_K, on m-packed labelings of tableaux. The operator pro was then extended to increasing labelings of other posets. The purpose of the current work is to show that the original action of pro_K on m-packed labelings yields interesting results when applied to partially ordered sets in general, and to rooted trees in particular. We show that under certain conditions, the sizes of the orbits and order of pro_K exhibit nice divisibility properties. We also completely determine, for certain values of m, the orbit sizes for the action on various types of rooted trees such as extended stars, combs, zippers, and a type of three-leaved tree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jamie Kimble, Bruce E. Sagan, Avery St. Dizier. 2026-03-10. K-promotion on m-packed labelings of posets. https://doi.org/10.46298/dmtcs.16351

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