English
Related papers

Related papers: A class of weighted Delannoy numbers

200 papers

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

Number Theory · Mathematics 2024-09-16 Seyran S. Ibrahimov , Nazim I. Mahmudov

We derive some combinatorial formulas related to the diagonal Ramsey numbers $R(k)$. Each formula is a statement of the form "$F(n,k) = 0$ if and only if $n \ge R(k)$," where $F(n,k)$ is a combinatorial expression which depends on $n$ and…

Combinatorics · Mathematics 2024-04-04 Pakawut Jiradilok

In 1995 Magnus posed a conjecture about the asymptotics of the recurrence coefficients of orthogonal polynomials with respect to the weights on [-1,1] of the form $$ (1-x)^\alpha (1+x)^\beta |x_0 - x|^\gamma \times a jump at x_0, $$ with…

Classical Analysis and ODEs · Mathematics 2009-05-19 A. Foulquie Moreno , A. Martinez-Finkelshtein , V. L. Sousa

We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…

Functional Analysis · Mathematics 2026-05-12 Chafiq Benhida , Raul E. Curto , George R. Exner

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Combinatorics · Mathematics 2025-01-24 Sophie Marques , Elizabeth Mrema

In this work we study the properties of a new algebraic variant of the degenerate Bernoulli polynomial $\tilde{\beta}_{k}(m,x)$ and study the corresponding degenerate Bernoulli number $\tilde{\beta}_{k}(m,1)=m^{k}\beta_{k}(1/m)$, where…

Number Theory · Mathematics 2021-10-28 N. Uday Kiran , Sampath Lonka

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

Number Theory · Mathematics 2014-07-31 Soohyun Park

Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…

Mathematical Physics · Physics 2022-03-11 Pavel Stovicek

We consider the numbers $\mathcal{B}_{r,s} = (\mathbf{B}+1)^r \mathbf{B}^s$ (in umbral notation $\mathbf{B}^n = \mathbf{B}_n$ with the Bernoulli numbers) that have a well-known reciprocity relation, which is frequently found in the…

Number Theory · Mathematics 2022-02-25 Bernd C. Kellner

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Classical Analysis and ODEs · Mathematics 2025-11-04 T. M. Dunster , Amparo Gil , Diego Ruiz-Antolin , Javier Segura

Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…

Combinatorics · Mathematics 2026-03-24 Voalaza Mahavily Romuald Aubert , Benjamin Randrianirina

We study asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight, which is a weight function with a finite number of algebraic singularities on $[-1,1]$. The recurrence coefficients…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. Vanlessen

Let $a$ and $b$ be relatively prime positive integers. In this paper the weighted sum $\sum_{n\in{\rm NR}(a,b)}\lambda^{n-1}n^m$ is given explicitly or in terms of the Apostol-Bernoulli numbers, where $m$ is a nonnegative integer, and ${\rm…

Number Theory · Mathematics 2021-05-19 Takao Komatsu , Yuan Zhang

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

q-alg · Mathematics 2008-02-03 Anne Schilling , S. Ole Warnaar

We perform a thorough investigation of the first FPUT recurrence in the $\beta$-FPUT chain for both positive and negative $\beta$. We show numerically that the rescaled FPUT recurrence time $T_{r}=t_{r}/(N+1)^{3}$ depends, for large $N$,…

Pattern Formation and Solitons · Physics 2019-12-03 Salvatore D. Pace , Kevin A. Reiss , David K. Campbell

We study linear recurrences of Eulerian type of the form \[ P_n(v) = (\alpha(v)n+\gamma(v))P_{n-1}(v) +\beta(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $\alpha(v), \beta(v)$ and $\gamma(v)$ are in most cases polynomials…

Combinatorics · Mathematics 2019-11-05 Hsien-Kuei Hwang , Hua-Huai Chern , Guan-Huei Duh

We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…

High Energy Physics - Theory · Physics 2015-06-22 J. Ablinger , J. Blümlein , C. G. Raab , C. Schneider

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

Number Theory · Mathematics 2026-04-13 Ruofan Li

In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…

Number Theory · Mathematics 2025-09-19 Yongkang Wan , Zhonghao Liang , Qunying Liao

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Combinatorics · Mathematics 2022-07-01 Robert Dougherty-Bliss