<p>Wilcox has considered a <i>twisted</i> semigroup algebra structure on the partition algebra <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb {C}A_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">C</mi> <msub> <mi>A</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, but it appears that there has not previously been any known basis that gives <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {C}A_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">C</mi> <msub> <mi>A</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> the structure of a “non-twisted” semigroup algebra or a monoid algebra. This motivates the following problem, for the non-degenerate case whereby <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(n \in \mathbb {C} \setminus \{ 0, 1, \ldots , 2 k - 2 \}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">C</mi> <mo lspace="0.15em" rspace="0.15em" stretchy="false">\</mo> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>2</mn> <mi>k</mi> <mo>-</mo> <mn>2</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> so that <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\( \mathbb {C}A_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">C</mi> <msub> <mi>A</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is semisimple. How could a basis <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(M_{k} = M\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>M</mi> <mi>k</mi> </msub> <mo>=</mo> <mi>M</mi> </mrow> </math></EquationSource> </InlineEquation> of <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\( \mathbb {C}A_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">C</mi> <msub> <mi>A</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be constructed so that <i>M</i> is closed under the multiplicative operation on <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\mathbb {C}A_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">C</mi> <msub> <mi>A</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, in such a way so that <i>M</i> is a monoid under this operation, and how could a product rule for elements in <i>M</i> be defined in an explicit and combinatorial way in terms of partition diagrams? We construct a basis <i>M</i> of the desired form using Halverson and Ram’s matrix unit construction for partition algebras, Benkart and Halverson’s bijection between vacillating tableaux and set-partition tableaux, an analogue given by Colmenarejo et al. for partition diagrams of the RSK correspondence, and a variant of a result due to Hewitt and Zuckerman characterizing finite-dimensional semisimple algebras that are isomorphic to semigroup algebras.</p>

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

Partition algebras as monoid algebras

  • John M. Campbell

摘要

Wilcox has considered a twisted semigroup algebra structure on the partition algebra \(\mathbb {C}A_k(n)\) C A k ( n ) , but it appears that there has not previously been any known basis that gives \(\mathbb {C}A_k(n)\) C A k ( n ) the structure of a “non-twisted” semigroup algebra or a monoid algebra. This motivates the following problem, for the non-degenerate case whereby \(n \in \mathbb {C} \setminus \{ 0, 1, \ldots , 2 k - 2 \}\) n C \ { 0 , 1 , , 2 k - 2 } so that \( \mathbb {C}A_k(n)\) C A k ( n ) is semisimple. How could a basis \(M_{k} = M\) M k = M of \( \mathbb {C}A_k(n)\) C A k ( n ) be constructed so that M is closed under the multiplicative operation on \(\mathbb {C}A_k(n)\) C A k ( n ) , in such a way so that M is a monoid under this operation, and how could a product rule for elements in M be defined in an explicit and combinatorial way in terms of partition diagrams? We construct a basis M of the desired form using Halverson and Ram’s matrix unit construction for partition algebras, Benkart and Halverson’s bijection between vacillating tableaux and set-partition tableaux, an analogue given by Colmenarejo et al. for partition diagrams of the RSK correspondence, and a variant of a result due to Hewitt and Zuckerman characterizing finite-dimensional semisimple algebras that are isomorphic to semigroup algebras.