<p>For all finite fields of <i>q</i> elements where <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_890_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="106" /> </InlineMediaObject> <EquationSource Format="TEX">\(q\equiv 1\pmod 4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>≡</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in terms of the primitive elements of the field. We also give polynomials providing involutions with larger number of terms but coefficients will be conveniently only two possible values. Our procedure gives at least <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_890_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\((q-1)/4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation> trinomials, and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_890_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\((q-1)/2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> quadrinomials, all yielding involutions with unique fixed points over a field of order <i>q</i>. Equal number of involutions with exactly <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_890_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\((q+1)/2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> fixed-points are provided as quadrinomials.</p>

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

Involutory permutations over finite fields given by trinomials and quadrinomials

  • Anitha G,
  • P Vanchinathan

摘要

For all finite fields of q elements where \(q\equiv 1\pmod 4\) q 1 ( mod 4 ) we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in terms of the primitive elements of the field. We also give polynomials providing involutions with larger number of terms but coefficients will be conveniently only two possible values. Our procedure gives at least \((q-1)/4\) ( q - 1 ) / 4 trinomials, and \((q-1)/2\) ( q - 1 ) / 2 quadrinomials, all yielding involutions with unique fixed points over a field of order q. Equal number of involutions with exactly \((q+1)/2\) ( q + 1 ) / 2 fixed-points are provided as quadrinomials.