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

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…

Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

Let $\mathcal{S}$ denote the class of analytic and univalent ({\it i.e.}, one-to-one) functions $ f(z)= z+\sum_{n=2}^{\infty}a_n z^n$ in the unit disk $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$. For $f\in \mathcal{S}$, In 1999, Ma proposed the…

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Let $A_{n,i,j}$ be the number of permutations on $[n]$ with $(i-1)$ descents and $(j-1)$ inverse descents.Carlitz, Roselle and Scoville in 1966 first revealed some combinatorial and arithmetic properties of $A_{n,i,j}$,which contain a…

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)…

A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

We study a new family of q-Meixner multiple orthogonal polynomials of the first kind. The discrete orthogonality conditions are considered over a non-uniform lattice with respect to different q-analogues of Pascal distributions. We address…

In previous papers, we discussed the recurrence relations of the multi-indexed orthogonal polynomials of the Laguerre, Jacobi, Wilson, Askey-Wilson, Racah and $q$-Racah types. In this paper we explore those of the Meixner-Pollaczek and…

We establish exact formulae for the persistence probabilities of an AR(1) sequence with symmetric uniform innovations in terms of certain families of polynomials, most notably a family introduced by Mallows and Riordan as enumerators of…

In 1956, Je$\acute{s}$manowicz conjectured that, for positive integers $m$ and $n$ with $m>n, \, \gcd(m,\, n)=1$ and $m\not\equiv n\pmod{2}$, the exponential Diophantine equation $(m^2-n^2)^x+(2mn)^y=(m^2+n^2)^z$ has only the positive…

We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…

In this paper we aim at constructing a sequence $\{\mathsf{M}_n^k(x)\}_{n\ge0}$ of $\mathbb R_{0,m}$-valued polynomials which are monogenic in $\mathbb R^{m+1}$ satisfying the Appell condition (i.e. the hypercomplex derivative of each…

We extend our result on the convergence of double recurrence Wiener-Wintner averages to the case where we have a polynomial exponent. We will show that there exists a single set of full measure for which the averages \[ \frac{1}{N}…

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…

Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…