<p>Given a subset <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathcal {S}\subseteq \mathbb {F}_q[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">S</mi> <mo>⊆</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and fixed integers <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(n,m\in \mathbb {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation>, we study the distribution of the smallest denominator <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(Q\in \mathcal {S}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Q</mi> <mo>∈</mo> <mi mathvariant="script">S</mi> </mrow> </math></EquationSource> </InlineEquation> for which there exists <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\textbf{P}\in \mathbb {F}_q[x]^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">P</mi> <mo>∈</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <msup> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\left\| \frac{\textbf{P}}{Q}-\varvec{\alpha }\right\| &lt;q^{-n}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfenced close="∥" open="∥"> <mfrac> <mi mathvariant="bold">P</mi> <mi>Q</mi> </mfrac> <mo>-</mo> <mrow> <mi mathvariant="bold-italic">α</mi> </mrow> </mfenced> <mo>&lt;</mo> <msup> <mi>q</mi> <mrow> <mo>-</mo> <mi>n</mi> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\varvec{\alpha }\in x^{-1}\mathbb {F}_q((x^{-1}))^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mi mathvariant="bold-italic">α</mi> </mrow> <mo>∈</mo> <msup> <mi>x</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <msup> <mrow> <mo stretchy="false">(</mo> <mrow> <mo stretchy="false">(</mo> <msup> <mi>x</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> is chosen randomly. We also consider the discrete analogue obtained by fixing a polynomial <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(N\in \mathbb {F}_q[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>N</mi> <mo>∈</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\textrm{deg}(N)=n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>deg</mtext> <mo stretchy="false">(</mo> <mi>N</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> and sampling <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\varvec{\alpha }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold-italic">α</mi> </mrow> </math></EquationSource> </InlineEquation> uniformly from <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\frac{1}{N}\mathbb {F}_q[x]^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>N</mi> </mfrac> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <msup> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>. We prove that for any infinite subset <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\mathcal {S}\subseteq \mathbb {F}_q[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">S</mi> <mo>⊆</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, for every <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(n\in \mathbb {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation> and every dimension <i>m</i>, the probability distributions of these two random variables coincide. This result is significantly stronger than the corresponding statement in the real setting, where Balazard and Martin showed that the averages of the discrete and continuous smallest denominator functions are asymptotically close.</p>

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

Minimal Denominators Lying in Subsets of the Ring of Polynomials over a Finite Field

  • Noy Soffer Aranov

摘要

Given a subset \(\mathcal {S}\subseteq \mathbb {F}_q[x]\) S F q [ x ] and fixed integers \(n,m\in \mathbb {N}\) n , m N , we study the distribution of the smallest denominator \(Q\in \mathcal {S}\) Q S for which there exists \(\textbf{P}\in \mathbb {F}_q[x]^m\) P F q [ x ] m such that \(\left\| \frac{\textbf{P}}{Q}-\varvec{\alpha }\right\| <q^{-n}\) P Q - α < q - n , where \(\varvec{\alpha }\in x^{-1}\mathbb {F}_q((x^{-1}))^m\) α x - 1 F q ( ( x - 1 ) ) m is chosen randomly. We also consider the discrete analogue obtained by fixing a polynomial \(N\in \mathbb {F}_q[x]\) N F q [ x ] with \(\textrm{deg}(N)=n\) deg ( N ) = n and sampling \(\varvec{\alpha }\) α uniformly from \(\frac{1}{N}\mathbb {F}_q[x]^m\) 1 N F q [ x ] m . We prove that for any infinite subset \(\mathcal {S}\subseteq \mathbb {F}_q[x]\) S F q [ x ] , for every \(n\in \mathbb {N}\) n N and every dimension m, the probability distributions of these two random variables coincide. This result is significantly stronger than the corresponding statement in the real setting, where Balazard and Martin showed that the averages of the discrete and continuous smallest denominator functions are asymptotically close.