English
Related papers

Related papers: Linear recurrence sequences with indices in arithm…

200 papers

In this paper we consider a semi-classical variation of the weight related to the little $q$-Laguerre polynomials and obtain a second order second degree discrete equation for the recurrence coefficients in the three-term recurrence…

Classical Analysis and ODEs · Mathematics 2015-03-10 Galina Filipuk , Christophe Smet

In a previous paper, we presented conjectures of the recurrence relations with constant coefficients for the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present a proof for the…

Mathematical Physics · Physics 2016-02-10 Satoru Odake

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

Combinatorics · Mathematics 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

Combinatorics · Mathematics 2017-11-30 Aung Phone Maw , Aung Kyaw

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

Probability · Mathematics 2016-05-17 Iddo Ben-Ari , Steven J. Miller

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Bruce E. Sagan

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

Number Theory · Mathematics 2024-06-26 Bernd C. Kellner , Jonathan Sondow

The partial sums of integer sequences that count the occurrences of a specific pattern in the binary expansion of positive integers have been investigated by different authors since the 1950s. In this note, we introduce generalized pattern…

Discrete Mathematics · Computer Science 2024-06-25 Shuo Li

The alternating and non-alternating harmonic sums and other algebraic objects of the same equivalence class are connected by algebraic relations which are induced by the product of these quantities and which depend on their index calss…

High Energy Physics - Phenomenology · Physics 2009-11-10 Johannes Blümlein

In a previous paper we presented $3+2M$ term recurrence relations with variable dependent coefficients for $M$-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present (conjectures of) the…

Mathematical Physics · Physics 2015-05-26 Satoru Odake

A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and…

Number Theory · Mathematics 2019-04-19 Rigoberto Flórez , Nathan McAnally , Antara Mukherjee

We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.

Combinatorics · Mathematics 2008-06-11 Johann Cigler

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

Number Theory · Mathematics 2023-09-04 Zubeyir Cinkir , Aysegul Ozturkalan

In this paper we compute the asymptotic behavior of the recurrence coefficients for polynomials orthogonal with respect to a logarithmic weight $w(x){\rm d}x = \log \frac{2k}{1-x}{\rm d}x$ on $(-1,1)$, $k > 1$, and verify a conjecture of…

Classical Analysis and ODEs · Mathematics 2018-06-13 Thomas Oliver Conway , Percy Deift

We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace's equation which arises in the context of the Calogero-Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials…

solv-int · Physics 2009-10-30 S. Chaturvedi

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…

Combinatorics · Mathematics 2020-09-15 Sudip Bera

We prove a linear recurrence relation for a large family of generalized Schreier sets, which generalizes the Fibonacci recurrence proved by Bird and higher order Fibonacci recurrence proved by the second author et al. Furthermore, we show a…

Combinatorics · Mathematics 2022-01-03 Kevin Beanland , Hung Viet Chu , Carrie E. Finch-Smith

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…