Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types A_n, B_n, C_n, D_n, and G₂

DOI10.1016/J.JCTA.2018.11.010MaRDI QIDQ1633382zbMATH OpenOpenAlexFDO

Authors Alan J. Cain, R. Gray, A. Malheiro

Publication date 19 December 2018

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

automatic monoid crystal basis plactic monoid rewriting system tableaux

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of representation theory (05E10)

Abstract: The vertices of any (combinatorial) Kashiwara crystal graph carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. Working on a purely combinatorial and monoid-theoretical level, we prove some foundational results for these crystal monoids, including the observation that they have decidable word problem when their weight monoid is a finite rank free abelian group. The problem of constructing finite complete rewriting systems, and biautomatic structures, for crystal monoids is then investigated. In the case of Kashiwara crystals of types

A_{n}

,

B_{n}

,

C_{n}

,

D_{n}

, and

G_{2}

(corresponding to the

q

-analogues of the Lie algebras of these types) these monoids are precisely the generalised plactic monoids investigated in work of Lecouvey. We construct presentations via finite complete rewriting systems for all of these types using a unified proof strategy that depends on Kashiwara's crystal bases and analogies of Young tableaux, and on Lecouvey's presentations for these monoids. As corollaries, we deduce that plactic monoids of these types have finite derivation type and satisfy the homological finiteness properties left and right

m a t h r m {F P}_{i} n f t y

. These rewriting systems are then applied to show that plactic monoids of these types are biautomatic and thus have word problem soluble in quadratic time.

Recommendations

Cites work

Cited in

(15)

This page was built for publication: Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)

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