<p>This paper introduces and systematically investigates Fibonacci-based analogues and generalizations of degenerate Stirling and Lah numbers. We begin by recalling the classical definitions and key properties of Stirling numbers of both kinds, Lah numbers, Fibonacci numbers, and Fibonomial coefficients, along with <i>F</i>-falling and <i>F</i>-rising factorials. The foundational concept of degenerate numbers and their associated degenerate factorials, as initiated by Carlitz, is also reviewed. Our primary contribution is the definition of four new families of numbers: the degenerate <i>F</i>-Stirling numbers of the first kind <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="MediaObjects/11139_2025_1198_IEq1_HTML.gif" Format="GIF" Height="26" Rendition="HTML" Resolution="120" Type="Linedraw" Width="44" /> </InlineMediaObject> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1198_Article_IEq2.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="68" /> </InlineMediaObject> <EquationSource Format="TEX">\(S_{1,\lambda }^F(n,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>S</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>λ</mi> </mrow> <mi>F</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, the degenerate <i>F</i>-Stirling numbers of the second kind <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1198_Article_IEq3.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="68" /> </InlineMediaObject> <EquationSource Format="TEX">\(S_{2,\lambda }^F(n,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>S</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>λ</mi> </mrow> <mi>F</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, and the degenerate <i>F</i>-Lah numbers <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1198_Article_IEq4.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="62" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_{\lambda }^F(n,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>L</mi> <mrow> <mi>λ</mi> </mrow> <mi>F</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. These numbers are precisely characterized as connection coefficients between the standard power basis <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1198_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="95" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{x^n: n \ge 0\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msup> <mi>x</mi> <mi>n</mi> </msup> <mo>:</mo> <mi>n</mi> <mo>≥</mo> <mn>0</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> and the <i>F</i>-falling and <i>F</i>-rising factorial bases, and their degenerate counterparts. We derive fundamental recurrence relations for each class of these new numbers, providing a structural foundation for their analysis. Furthermore, we establish their generating functions and prove several combinatorial identities, including inverse relations. Our methodology primarily utilizes generating function techniques and properties of degenerate Fibonacci-based exponential and logarithmic functions. This work extends the rich theory of degenerate combinatorial numbers into the realm of Fibonacci sequences, offering new insights into their algebraic and combinatorial structures.</p>

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

Fibonacci-based generalizations of degenerate Stirling numbers

  • Orhan Dişkaya

摘要

This paper introduces and systematically investigates Fibonacci-based analogues and generalizations of degenerate Stirling and Lah numbers. We begin by recalling the classical definitions and key properties of Stirling numbers of both kinds, Lah numbers, Fibonacci numbers, and Fibonomial coefficients, along with F-falling and F-rising factorials. The foundational concept of degenerate numbers and their associated degenerate factorials, as initiated by Carlitz, is also reviewed. Our primary contribution is the definition of four new families of numbers: the degenerate F-Stirling numbers of the first kind and \(S_{1,\lambda }^F(n,k)\) S 1 , λ F ( n , k ) , the degenerate F-Stirling numbers of the second kind \(S_{2,\lambda }^F(n,k)\) S 2 , λ F ( n , k ) , and the degenerate F-Lah numbers \(L_{\lambda }^F(n,k)\) L λ F ( n , k ) . These numbers are precisely characterized as connection coefficients between the standard power basis \(\{x^n: n \ge 0\}\) { x n : n 0 } and the F-falling and F-rising factorial bases, and their degenerate counterparts. We derive fundamental recurrence relations for each class of these new numbers, providing a structural foundation for their analysis. Furthermore, we establish their generating functions and prove several combinatorial identities, including inverse relations. Our methodology primarily utilizes generating function techniques and properties of degenerate Fibonacci-based exponential and logarithmic functions. This work extends the rich theory of degenerate combinatorial numbers into the realm of Fibonacci sequences, offering new insights into their algebraic and combinatorial structures.