中文
相关论文

相关论文: Fibonacci numbers and orthogonal polynomials

200 篇论文

The purpose of this note is to characterize those orthogonal polynomials sequences $(P_n)_{n\geq0}$ for which $$ \pi(x)\mathcal{D}_q P_n(x)=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\mathcal{D}_q$ is the Askey-Wilson…

经典分析与常微分方程 · 数学 2021-10-08 K. Castillo , D. Mbouna , J. Petronilho

In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…

经典分析与常微分方程 · 数学 2019-02-12 Sergey M. Zagorodnyuk

In this work, the concept of quasi-type Kernel polynomials with respect to a moment functional is introduced. Difference equation satisfied by these polynomials along with the criterion for orthogonality conditions are discussed. The…

谱理论 · 数学 2023-01-31 Vikash Kumar , A. Swaminathan

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

复变函数 · 数学 2019-03-05 Min-Hee Kim , Young-One Kim , Jungseob Lee

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

经典分析与常微分方程 · 数学 2026-03-12 Vitaly M. Khamitov , Dmitriy Dmitrishin , Alexander Stokolos , Daniel Gray

We study the orthogonal polynomials associated with the equilibrium measure, in logarithmic potential theory, living on the attractor of an Iterated Function System. We construct sequences of discrete measures, that converge weakly to the…

数值分析 · 数学 2015-12-24 Giorgio Mantica

We look for spectral type differential equations satisfied by the generalized Jacobi polynomials, which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with…

经典分析与常微分方程 · 数学 2015-06-26 J. Koekoek , R. Koekoek

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

数论 · 数学 2011-04-11 Lenny Jones

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

数论 · 数学 2023-05-11 Sushma Palimar

In this paper we consider an appropriate ordering of the Laurent monomials $x^{i}y^{j}$, $i,j \in \mathbb{Z}$ that allows us to study sequences of orthogonal Laurent polynomials of the real variables $x$ and $y$ with respect to a positive…

数值分析 · 数学 2024-09-20 Ruymán Cruz-Barroso , Lidia Fernández

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

数论 · 数学 2008-12-16 Tewodros Amdeberhan

This paper presents a new generalization of the Genocchi numbers and the Genocchi theorem. As consequences, we obtain some important families of integer-valued polynomials those are closely related to the Bernoulli polynomials. Denoting by…

数论 · 数学 2020-12-04 Bakir Farhi

Motivated by the Hankel determinant evaluation of moment sequences, we study a kind of Pfaffian analogue evaluation. We prove an LU-decomposition analogue for skew-symmetric matrices, called Pfaffian decomposition. We then apply this…

组合数学 · 数学 2010-11-30 Masao Ishikawa , Hiroyuki Tagawa , Jiang Zeng

We determine the order of magnitude of the variance of the Fibonacci partition function. The answer is different to the most naive guess. The proof involves a diophantine system and an inhomogeneous linear recurrence.

数论 · 数学 2023-08-30 Sam Chow , Owen Jones

This paper analyzes the concept of orthogonality in second-order polynomial sequences that have Binet formula similar to that of the Fibonacci and Lucas numbers, referred to as Generalized Fibonacci Polynomials (GFP). We give a technique to…

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

概率论 · 数学 2007-05-23 Kevin Costello , Terence Tao , Van Vu

We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.

数论 · 数学 2021-12-02 Kunle Adegoke

Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…

概率论 · 数学 2024-02-07 Mustafa Alper Gunes

The Fibonacci groups $F(n)$ are known to exhibit significantly different behaviour depending on the parity of $n$. We extend known results for $F(n)$ for odd $n$ to the family of Fractional Fibonacci groups $F^{k/l}(n)$. We show that for…

群论 · 数学 2022-03-29 Ihechukwu Chinyere , Gerald Williams

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

数论 · 数学 2023-04-18 H. E. A. Campbell , David L. Wehlau