<p>We propose a generalization of the Pascal <i>n</i>-simplex by considering the generators <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11785_2025_1820_Article_IEq1.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(e_1,e_2,\dots ,e_n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>e</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>e</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>e</mi> <mi>n</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> of the <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11785_2025_1820_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(2^n-\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mn>2</mn> <mi>n</mi> </msup> <mo>-</mo> </mrow> </math></EquationSource> </InlineEquation>dimensional Clifford algebra <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11785_2025_1820_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {C} \ell }_{0,n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mi mathvariant="script">C</mi> <mi>ℓ</mi> </mrow> <mrow> <mn>0</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11785_2025_1820_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">R</mi> </math></EquationSource> </InlineEquation> in the multinomial expansion of powers of their sum. We investigate various patterns within this structure and examine several of its properties and associated combinatorial identities. Our results establish a direct connection between this hypercomplex Pascal <i>n</i>-simplex and the terms of a generalized Vietoris number sequence, which plays an important role in the theory of Appell hypercomplex polynomials.</p>

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

On the Pascal simplex with hypercomplex entries

  • Carla Cruz,
  • M. Irene Falcão,
  • Helmuth R. Malonek,
  • Graça Tomaz

摘要

We propose a generalization of the Pascal n-simplex by considering the generators \(e_1,e_2,\dots ,e_n\) e 1 , e 2 , , e n of the \(2^n-\) 2 n - dimensional Clifford algebra \({\mathcal {C} \ell }_{0,n}\) C 0 , n over \(\mathbb {R}\) R in the multinomial expansion of powers of their sum. We investigate various patterns within this structure and examine several of its properties and associated combinatorial identities. Our results establish a direct connection between this hypercomplex Pascal n-simplex and the terms of a generalized Vietoris number sequence, which plays an important role in the theory of Appell hypercomplex polynomials.