<p>Consider a commutative ring <i>R</i> with 1. A formal power series <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12215_2024_1179_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="214" /> </InlineMediaObject> <EquationSource Format="TEX">\(F(x_1,\ldots ,x_n)\in R[\![x_1,\ldots ,x_n]\!]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>∈</mo> <mi>R</mi> <mrow> <mo stretchy="false">[</mo> <mspace width="-0.166667em" /> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> <mspace width="-0.166667em" /> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in <i>n</i> variables, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12215_2024_1179_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, of order at least 1 is called <i>n</i>-associative, if the following equations <Equation ID="Equ13"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="12215_2024_1179_Article_Equ13.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="579" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} F(F(x_1,\ldots ,x_n),x_{n+1},\ldots ,x_{2n-1})=\ldots = F(x_1,\ldots ,x_{n-1},F(x_n,x_{n+1},\ldots ,x_{2n-1})) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mo>…</mo> <mo>=</mo> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>hold true. This notion generalizes associativity which is the special case for <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12215_2024_1179_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. We describe <i>n</i>-associative formal power series over <i>R</i>. Some examples of commutative (or symmetric) <i>n</i>-associative formal power series are presented.</p>

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

On n-associative formal power series over rings

  • Susan F. El-Deken,
  • Harald Fripertinger

摘要

Consider a commutative ring R with 1. A formal power series \(F(x_1,\ldots ,x_n)\in R[\![x_1,\ldots ,x_n]\!]\) F ( x 1 , , x n ) R [ [ x 1 , , x n ] ] in n variables, \(n\ge 3\) n 3 , of order at least 1 is called n-associative, if the following equations \(\begin{aligned} F(F(x_1,\ldots ,x_n),x_{n+1},\ldots ,x_{2n-1})=\ldots = F(x_1,\ldots ,x_{n-1},F(x_n,x_{n+1},\ldots ,x_{2n-1})) \end{aligned}\) F ( F ( x 1 , , x n ) , x n + 1 , , x 2 n - 1 ) = = F ( x 1 , , x n - 1 , F ( x n , x n + 1 , , x 2 n - 1 ) ) hold true. This notion generalizes associativity which is the special case for \(n=2\) n = 2 . We describe n-associative formal power series over R. Some examples of commutative (or symmetric) n-associative formal power series are presented.