Related papers: A Classic Proof of a Recurrence for a Very Classic…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…
We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel,…
The present study provides another look on Lamperti's theorem on recurrence or transience of stochastic sequences. We establish connection between Lamperti's theorem and the recent result by the author [V. M. Abramov, Theor. Probab. Math.…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…
We give a new proof of the identity $\zeta(\{2,1\}^l)=\zeta(\{3\}^l)$ of the multiple zeta values, where $l=1,2,\dots$, using generating functions of the underlying generalized polylogarithms. In the course of study we arrive at…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…
I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence…
We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \[ \binom{a p}{b p} \equiv \binom{a}{b} \] modulo $p^3$ for primes $p\ge5$. This congruence subsumes and builds on earlier congruences by Babbage,…
In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…
In this note, we prove the last remaining case of the original 15 two-term supercongruence conjectures for sporadic sequences. The proof utilizes a new representation for this sequence (due to Gorodetsky) as the constant term of powers of a…
The set of terms of an infinite sequence expressed by a recurrence relation is equal to the set of maximum numbers of all primitive Pythagorean triples such that the difference between the two non-maximum numbers is 1, which Cimmino showed.…
In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this…
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…