Related papers: A method for deterining the mod-$3^k$ behaviour of…
We derive a concise closed-form solution for a linear three-term recurrence relation. Such recurrence relations are very common in the quantitative sciences, and describe finite difference schemes, solutions to problems in Markov processes…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…
Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…
We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.
We investigate a (potentially infinite) series of subfactors, called $3^n$ subfactors, including $A_4$, $A_7$, and the Haagerup subfactor as the first three members corresponding to $n=1,2,3$. Generalizing our previous work for odd $n$, we…
The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
The Euler-Kronecker constants related to congruences of Fourier coefficients of modular forms that have been computed so far, involve logarithmic derivatives of Dirichlet $L$-series as most complicated functions (to the best of our…
Traces of powers of the zero mode in the W3 Algebra have recently been found to be of interest, for example in relation to Black Hole thermodynamics, and arise as the terms in an expansion of the full characters of the algebra. We calculate…
We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…
We give unified modular proofs to all of Gosper's identities on the $q$-constant $\Pi_q$. We also confirm Gosper's observation that for any distinct positive integers $n_1,\cdots,n_m$ with $m\geq 3$, $\Pi_{q^{n_1}}$, $\cdots$,…
We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…
The Catalan numbers $C_k$ were first studied by Euler, in the context of enumerating triangulations of polygons $P_{k+2}$. Among the many generalizations of this sequence, the Fuss-Catalan numbers $C^{(d)}_k$ count enumerations of…
We derive a system of difference equations satisfied by the three-term recurrence coefficients of some families of discrete orthogonal polynomials.
In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…