<p>Let <i>u</i> be a word over the positive integers <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({\mathbb {P}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">P</mi> </math></EquationSource> </InlineEquation>. Motivated by a question involving crystal graphs, Sagan and Wilson initiated the study of the centralizer of <i>u</i> in the plactic monoid which is the set <Equation ID="Equ24"> <EquationSource Format="TEX">\( C(u) = \{w \mid uw \text { is Knuth equivalent to } wu\}. \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mi>C</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mo stretchy="false">{</mo> <mi>w</mi> <mo>∣</mo> <mi>u</mi> <mi>w</mi> <mspace width="0.333333em" /> <mtext>is Knuth equivalent to</mtext> <mspace width="0.333333em" /> <mi>w</mi> <mi>u</mi> <mo stretchy="false">}</mo> <mo>.</mo> </mrow> </math></EquationSource> </Equation>In particular, they conjectured the following stability phenomenon: for any <i>u</i> there is a positive integer <i>K</i> depending only on <i>u</i> such that <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(C(u^k) = C(u^K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>C</mi> <mrow> <mo stretchy="false">(</mo> <msup> <mi>u</mi> <mi>k</mi> </msup> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>C</mi> <mrow> <mo stretchy="false">(</mo> <msup> <mi>u</mi> <mi>K</mi> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(k\ge K\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mi>K</mi> </mrow> </math></EquationSource> </InlineEquation>. We prove that this property holds for various <i>u</i> including words consisting of only ones and twos, as well as permutations. Sagan and Wilson also considered <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(c_{n,m}(u)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>c</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> which is the number of <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(w\in C(u)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>w</mi> <mo>∈</mo> <mi>C</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of length <i>n</i> and maximum at most <i>m</i>. They showed that <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(c_{n,m}(1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>c</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is a polynomial in <i>m</i> of degree <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(n-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> 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.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Properties of plactic monoid centralizers

  • Bruce E. Sagan,
  • Chenchen Zhao

摘要

Let u be a word over the positive integers \({\mathbb {P}}\) 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 \mid uw \text { is Knuth equivalent to } wu\}. \) C ( u ) = { w u w is Knuth equivalent to w u } . 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)\) C ( u k ) = C ( u K ) for \(k\ge K\) 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)\) c n , m ( u ) which is the number of \(w\in C(u)\) w C ( u ) of length n and maximum at most m. They showed that \(c_{n,m}(1)\) c n , m ( 1 ) is a polynomial in m of degree \(n-1\) 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.