相关论文: A short proof of Mathar's 2013 recurrence conjectu…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

In [8] (Nakagawa, et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order $O(1/N)$ was analyzed by focusing on the second-order nonlinear recurrence formula…

Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger…

The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the…

For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…

We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…

Let $T$ be an underlying space with a non-atomic measure $\sigma$ on it. In [{\it Comm.\ Math.\ Phys.}\ {\bf 292} (2009), 99--129] the Meixner class of non-commutative generalized stochastic processes with freely independent values,…

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

On page 3 of his lost notebook, Ramanujan defines the Appell-Lerch sum $$\phi(q):=\sum_{n=0}^\infty \dfrac{(-q;q)_{2n}q^{n+1}}{(q;q^2)_{n+1}^2},$$ which is connected to some of his sixth order mock theta functions. Let $\sum_{n=1}^\infty…

The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…

We study the asymptotic behavior of Multiple Meixner polynomials of first and second kind, respectively (see J. Arves\'u et al. J. Comput. Appl. Math., 153, (2003)). We use an algebraic function formulation for the solution of the…

We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by…

The Hofstadter Q-sequence is a prominent example of nested recurrence. Despite decades of study, it is not even known whether Q(n) is defined for all n. Mantovanelli introduced a parity-perturbed variant $\widetilde{Q}$, obtained by adding…

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

Let $P\in\Z[n]$ with $P(0)=0$ and $\VE>0$. We show, using Fourier analytic techniques, that if $N\geq \exp\exp(C\VE^{-1}\log\VE^{-1})$ and $A\subseteq\{1,\...,N\}$, then there must exist $n\in\N$ such that \[\frac{|A\cap…

The exponential generating function for the sequence A143405 in the OEIS is exp(exp(x)*(exp(x) - 1)). This paper analyzes the more general generating function exp(m*exp(b*x) + r*exp(d*x) + s) and provides asymptotics for the sequences…

We show how Viennot's combinatorial theory of orthogonal polynomials may be used to generalize some recent results of Sukumar and Hodges on the matrix entries in powers of certain operators in a representation of su(1,1). Our results link…