Related papers: On the period mod $m$ of polynomially-recursive se…
We extend Mullin's prime-generating procedures to produce sequences of primes lying in given residue classes. In particular we study the sequences generated by cyclotomic polynomials $\Phi_m(cx)$ for suitable $c\in\mathbb{Z}$. Under the…
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…
Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…
By a classical principle of probability theory, sufficiently thin subsequences of general sequences of random variables behave like i.i.d.\ sequences. This observation not only explains the remarkable properties of lacunary trigonometric…
Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.
Let $f$ be a power series with positive radius of convergence. In the present paper, we study the phenomenon of overconvergence of sequences of classical Pade' approximants pi{n,m_n} associated with f, where m(n)<=m(n+1)<=m(n) and m(n) =…
Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
We investigate the second-order correlation function of the characteristic polynomial of a sample covariance matrix. Starting from an explicit formula for the generating function, we re-obtain several well-known kernels from random matrix…
We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing…
Odd degree Chebyshev polynomials over a ring of modulo $2^w$ have two kinds of period. One is an "orbital period". Odd degree Chebyshev polynomials are bijection over the ring. Therefore, when an odd degree Chebyshev polynomial iterate…
We complete the study of some periods of polynomials in (n+1) variables with (n+2) monomials in computing the behavior of these periods in the natural parameter for such a polynomial.
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
In this paper the problems of the retrospective analysis of models with time-varying structure are considered. These models include contamination models with randomly switching parameters and multivariate classification models with an…
We study solutions of three-term recurrence relations whose $N$-step transfer matrices belong to the uniform Stolz class. In particular, we derive the first order of their uniform asymptotics. For orthonormal polynomials we show more.…
We study Piatetski-Shapiro sequences $(\lfloor n^c\rfloor)_n$ modulo m, for non-integer $c >1$ and positive $m$, and we are particularly interested in subword occurrences in those sequences. We prove that each block $\in\{0,1\}^k$ of length…
We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined…
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
We study the behavior of the superperiod map near the boundary of the moduli space of stable supercurves and prove that it is similar to the behavior of periods of classical curves. We consider two applications to the geometry of this…