Related papers: Degree k Linear Recursions Mod(p)

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4…

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…

Let F:K be a Galois extension of number fields and Q a prime ideal of O_F lying over the prime P of O_K. By analyzing the Q-adic closure of O_K in O_F we characterize those rings of integers O_K for which every residue class ring of…

Recently, a framework for analyzing time series by constructing an associated complex network has attracted significant research interest. One of the advantages of the complex network method for studying time series is that complex network…

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

When $p(t)$ is a polynomial of degree $d$, $k$-th column of the Riordan array $\bigl(1/(1 - t^{d+1}), tp(t)\bigr)$ is an eventually periodic sequence with the repeating part beginning at the $1 + (k-1)(d+1)$-st term. The pre-periodic terms…

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

The paper is devoted to produce infinite sequences of $k$-normal polynomials $F_{u}(x)\in \mathbb{F}_{q}[x]$ of degrees $np^{u} ~ (u\geq 0)$, for a suitably chosen initial $k$-normal polynomial $F_{0}(x)\in \mathbb{F}_{q}[x]$ of degree $n$…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

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…

We give a simple condition for a linear recurrence (mod 2^w) of degree r to have the maximal possible period 2^(w-1).(2^r-1). It follows that the period is maximal in the cases of interest for pseudo-random number generation, i.e. for…

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

By using the known description of combinatorial bases for Feigin-Stoyanovsky's type subspaces of standard modules for affine Lie algebra $\mathfrak{sl}(l+1,\mathbb{C})^{\widetilde{}}$, as well as certain intertwining operators between…