<p>In this paper, we are interested in the following problem: determine all <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(f \in {\mathbb Z}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> which are expressible as a sum of several cubes of polynomials in <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({\mathbb Z}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">Z</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>. We establish a necessary and sufficient condition in terms of the coefficients of <i>f</i> for this to occur. Similar conditions for <i>f</i> to be expressible as a sum of <i>p</i>th powers of polynomials in <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\({\mathbb Z}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">Z</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> are established not only for <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(p=3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, but also for <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(p=5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(p=7\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mn>7</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(p=11\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mn>11</mn> </mrow> </math></EquationSource> </InlineEquation>. In the latter case, the necessary and sufficient condition is a simple one: the polynomial <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(f(x)=a_0+a_1x+\dots +a_nx^n \in {\mathbb Z}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mi>a</mi> <mn>0</mn> </msub> <mo>+</mo> <msub> <mi>a</mi> <mn>1</mn> </msub> <mi>x</mi> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <msup> <mi>x</mi> <mi>n</mi> </msup> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is expressible as a sum of the eleventh powers of polynomials in <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\({\mathbb Z}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">Z</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> if and only if <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(11 \mid ka_k\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>11</mn> <mo>∣</mo> <mi>k</mi> <msub> <mi>a</mi> <mi>k</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> for each <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(k \in \{0,1,\dots ,n\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <mi>n</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Integer Polynomials Expressible as Sums of Cubes

  • Artūras Dubickas,
  • Aivaras Novikas

摘要

In this paper, we are interested in the following problem: determine all \(f \in {\mathbb Z}[x]\) f Z [ x ] which are expressible as a sum of several cubes of polynomials in \({\mathbb Z}[x]\) Z [ x ] . We establish a necessary and sufficient condition in terms of the coefficients of f for this to occur. Similar conditions for f to be expressible as a sum of pth powers of polynomials in \({\mathbb Z}[x]\) Z [ x ] are established not only for \(p=3\) p = 3 , but also for \(p=5\) p = 5 , \(p=7\) p = 7 and \(p=11\) p = 11 . In the latter case, the necessary and sufficient condition is a simple one: the polynomial \(f(x)=a_0+a_1x+\dots +a_nx^n \in {\mathbb Z}[x]\) f ( x ) = a 0 + a 1 x + + a n x n Z [ x ] is expressible as a sum of the eleventh powers of polynomials in \({\mathbb Z}[x]\) Z [ x ] if and only if \(11 \mid ka_k\) 11 k a k for each \(k \in \{0,1,\dots ,n\}\) k { 0 , 1 , , n } .