Search arXivSearch

arXiv · 2512.21401

Properties of plactic monoid centralizers

Abstract

Let u be a word over the positive integers P. Motivated by a question involving crystal graphs, Sagan and Wilson initiated the study of the centralizer of u in the plactic monoid which is the set C(u) = {w | uw is Knuth equivalent to wu}. In particular, they conjectured the following stability phenomenon: for any u there is a positive integer K depending only on u such that C(u^k) = C(u^K) for k >= K. We prove that this property holds for various u including words consisting of only ones and twos, as well as permutations. Sagan and Wilson also considered c_{n,m}(u) which is the number of w in C(u) of length n and maximum at most m. They showed that c_{n,m}(1) is a polynomial in m of degree n-1 and conjectured properties of the coefficients when it is expanded in a binomial coefficient basis. We prove some of these conjectures, for example, that the coefficients are always nonnegative integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bruce E. Sagan, Chenchen Zhao. 2025-12-24. Properties of plactic monoid centralizers. https://arxiv.org/abs/2512.21401

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO