Related papers: Degree k Linear Recursions Mod(p)

We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Let $(Q,\mathfrak{n})$ be a regular local ring of dimension $c \geq 2$ with algebraically closed residue field $k = Q/\mathfrak{n}$. Let $f_1, f_2, \ldots f_{c-1}, g$ be a regular sequence in $Q$ such that $ f_i \in \mathfrak{n}^2$ for all…

In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…

For a given point P in the group of K-rational points E(K) of an elliptic curve, we consider the sequence of values (F_1(P),F_2(P),F_3(P),...) of the division polynomials of E at P. If K is a finite field, we prove that the sequence is…

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Let $k$ and $n$ be positive integers. Let $c\phi_{k}(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$ and $\mathrm{C}\Phi_k(q)$ be the generating function of $c\phi_{k}(n)$. In this article, we study…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…

We compute the generic degrees of the Ariki--Koike algebras by first constructing a basis of matrix units in the semisimple case. As a consequence, we also obtain an explicit isomorphism from any semisimple Ariki--Koike algebra to the group…

The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime…

The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…

In this paper we describe several characterizations of basic finite-dimensional $k$-algebras $A$ stratified for all linear orders, and classify their graded algebras as tensor algebras satisfying some extra property. We also discuss whether…

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Let $F_n(x)$ be the partition polynomial $\sum_{k=1}^n p_k(n) x^k$ where $p_k(n)$ is the number of partitions of $n$ with $k$ parts. We emphasize the computational experiments using degrees up to $70,000$ to discover the asymptotics of…

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

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…