<p>This paper studies properties of the integer sequence <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq1.gif" Format="GIF" Height="48" Rendition="HTML" Resolution="72" Type="Linedraw" Width="150" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\overline{G}}_n=\prod _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> <mi>n</mi> </msub> <mo>=</mo> <msubsup> <mo>∏</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <mrow> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation> which is analogous to <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq2.gif" Format="GIF" Height="43" Rendition="HTML" Resolution="72" Type="Linedraw" Width="131" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{G}_n=\prod _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mi>n</mi> </msub> <mo>=</mo> <msubsup> <mo>∏</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>n</mi> </msubsup> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> </mrow> </math></EquationSource> </InlineEquation>, the product of the elements of the <i>n</i>-th row of Pascal’s triangle. Here <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq3.gif" Format="GIF" Height="48" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\(\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <mrow> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> is an extended binomial coefficient, defined in the paper, constructed using an extended version of M. Bhargava’s theory of generalized factorials. In 1996 M. Bhargava introduced a generalization of the factorial function, <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq4.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="126" /> </InlineMediaObject> <EquationSource Format="TEX">\(n!_S=\prod _p\nu _n(S,p)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <msub> <mo>!</mo> <mi>S</mi> </msub> <mo>=</mo> <msub> <mo>∏</mo> <mi>p</mi> </msub> <msub> <mi>ν</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>S</mi> <mo>,</mo> <mi>p</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in terms of their prime factorization, and defines associated binomial coefficients. The last two authors extended Bhargava’s invariants further to define such invariants attached to each integer <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(b\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>b</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. One obtains extended factorials and extended binomial coefficients, and the maximal extension defines extended factorials <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq6.gif" Format="GIF" Height="24" Rendition="HTML" Resolution="72" Type="Linedraw" Width="144" /> </InlineMediaObject> <EquationSource Format="TEX">\(n!_{\mathbb {Z,N}}=\prod _{b\ge 2}b^{\alpha _n(\mathbb {Z},b)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <msub> <mo>!</mo> <mrow> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> <mo>=</mo> <msub> <mo>∏</mo> <mrow> <mi>b</mi> <mo>≥</mo> <mn>2</mn> </mrow> </msub> <msup> <mi>b</mi> <mrow> <msub> <mi>α</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mi>b</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> including all <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(b\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>b</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, with associated extended binomial coefficients <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq3.gif" Format="GIF" Height="48" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\(\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <mrow> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>, yielding <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq9.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\overline{G}}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>. We have <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq10.gif" Format="GIF" Height="24" Rendition="HTML" Resolution="72" Type="Linedraw" Width="122" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\overline{G}}_n=\prod _{b=2}^nb^{\overline{\nu }(n,b)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> <mi>n</mi> </msub> <mo>=</mo> <msubsup> <mo>∏</mo> <mrow> <mi>b</mi> <mo>=</mo> <mn>2</mn> </mrow> <mi>n</mi> </msubsup> <msup> <mi>b</mi> <mrow> <mover> <mi>ν</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>b</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> and the partial factorizations <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq11.gif" Format="GIF" Height="25" Rendition="HTML" Resolution="72" Type="Linedraw" Width="154" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\overline{G}}(n,x)=\prod _{b=2}^{\lfloor x\rfloor }b^{\overline{\nu }(n,b)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msubsup> <mo>∏</mo> <mrow> <mi>b</mi> <mo>=</mo> <mn>2</mn> </mrow> <mrow> <mo>⌊</mo> <mi>x</mi> <mo>⌋</mo> </mrow> </msubsup> <msup> <mi>b</mi> <mrow> <mover> <mi>ν</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>b</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>. This paper shows <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq12.gif" Format="GIF" Height="24" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(\log \overline{\overline{G}}(n,\alpha n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>log</mo> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>α</mi> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is well approximated by <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq13.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="173" /> </InlineMediaObject> <EquationSource Format="TEX">\(f_{\overline{\overline{G}}}(\alpha )n^2\log n+g_{\overline{\overline{G}}}(\alpha )n^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>f</mi> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> <msup> <mi>n</mi> <mn>2</mn> </msup> <mo>log</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>g</mi> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> <msup> <mi>n</mi> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> as <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq14.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\rightarrow \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation> for limit functions <InlineEquation ID="IEq15"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq15.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(f_{\overline{\overline{G}}}(\alpha )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>f</mi> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq16"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq16.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(g_{\overline{\overline{G}}}(\alpha )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>g</mi> <mover> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>¯</mo> </mover> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> defined for all <InlineEquation ID="IEq17"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq17.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\(0\le \alpha \le 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>≤</mo> <mi>α</mi> <mo>≤</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. The remainder term has a power saving in <i>n</i>. The main results are deduced from study of functions <InlineEquation ID="IEq18"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq18.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{A}(n,x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>A</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq19"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq19.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{B}(n,x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>B</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> that encode statistics of the base <i>b</i> radix expansions of the integer <i>n</i> (and smaller integers), where the base <i>b</i> ranges over all integers <InlineEquation ID="IEq20"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq20.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\(2\le b\le x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo>≤</mo> <mi>b</mi> <mo>≤</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation>. Unconditional estimates of <InlineEquation ID="IEq21"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq18.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{A}(n,x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>A</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq22"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1128_Article_IEq19.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{B}(n,x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>B</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> are derived.</p>

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

Products of extended binomial coefficients and their partial factorizations

  • Lara Du,
  • Jeffrey Lagarias,
  • Wijit Yangjit

摘要

This paper studies properties of the integer sequence \(\overline{\overline{G}}_n=\prod _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\) G ¯ ¯ n = k = 0 n n k Z , N which is analogous to \(\overline{G}_n=\prod _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) \) G ¯ n = k = 0 n n k , the product of the elements of the n-th row of Pascal’s triangle. Here \(\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\) n k Z , N is an extended binomial coefficient, defined in the paper, constructed using an extended version of M. Bhargava’s theory of generalized factorials. In 1996 M. Bhargava introduced a generalization of the factorial function, \(n!_S=\prod _p\nu _n(S,p)\) n ! S = p ν n ( S , p ) in terms of their prime factorization, and defines associated binomial coefficients. The last two authors extended Bhargava’s invariants further to define such invariants attached to each integer \(b\ge 2\) b 2 . One obtains extended factorials and extended binomial coefficients, and the maximal extension defines extended factorials \(n!_{\mathbb {Z,N}}=\prod _{b\ge 2}b^{\alpha _n(\mathbb {Z},b)}\) n ! Z , N = b 2 b α n ( Z , b ) including all \(b\ge 2\) b 2 , with associated extended binomial coefficients \(\left( {\begin{array}{c}n\\ k\end{array}}\right) _{\mathbb {Z,N}}\) n k Z , N , yielding \(\overline{\overline{G}}_n\) G ¯ ¯ n . We have \(\overline{\overline{G}}_n=\prod _{b=2}^nb^{\overline{\nu }(n,b)}\) G ¯ ¯ n = b = 2 n b ν ¯ ( n , b ) and the partial factorizations \(\overline{\overline{G}}(n,x)=\prod _{b=2}^{\lfloor x\rfloor }b^{\overline{\nu }(n,b)}\) G ¯ ¯ ( n , x ) = b = 2 x b ν ¯ ( n , b ) . This paper shows \(\log \overline{\overline{G}}(n,\alpha n)\) log G ¯ ¯ ( n , α n ) is well approximated by \(f_{\overline{\overline{G}}}(\alpha )n^2\log n+g_{\overline{\overline{G}}}(\alpha )n^2\) f G ¯ ¯ ( α ) n 2 log n + g G ¯ ¯ ( α ) n 2 as \(n\rightarrow \infty \) n for limit functions \(f_{\overline{\overline{G}}}(\alpha )\) f G ¯ ¯ ( α ) and \(g_{\overline{\overline{G}}}(\alpha )\) g G ¯ ¯ ( α ) defined for all \(0\le \alpha \le 1\) 0 α 1 . The remainder term has a power saving in n. The main results are deduced from study of functions \(\overline{A}(n,x)\) A ¯ ( n , x ) and \(\overline{B}(n,x)\) B ¯ ( n , x ) that encode statistics of the base b radix expansions of the integer n (and smaller integers), where the base b ranges over all integers \(2\le b\le x\) 2 b x . Unconditional estimates of \(\overline{A}(n,x)\) A ¯ ( n , x ) and \(\overline{B}(n,x)\) B ¯ ( n , x ) are derived.