Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, and related monoids

From MaRDI portal
Publication:1678353

DOI10.1007/978-3-319-66396-8_18zbMATH Open1405.05193arXiv1611.04152OpenAlexW2964350937MaRDI QIDQ1678353FDOQ1678353

Alan J. Cain, A. Malheiro

Publication date: 15 November 2017

Abstract: The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. For certain monoids connected with combinatorics, such as the plactic monoid (the monoid of Young tableaux) and the sylvester monoid (the monoid of binary search trees), connected components consist of elements that have the same evaluation (that is, contain the same number of each generating symbol). This paper discusses new results on the diameters of connected components of the cyclic shift graphs of the finite-rank analogues of these monoids, showing that the maximum diameter of a connected component is dependent only on the rank. The proof techniques are explained in the case of the sylvester monoid.


Full work available at URL: https://arxiv.org/abs/1611.04152






Cited In (4)


Recommendations





This page was built for publication: Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, and related monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678353)