Related papers: Effective formulas for linear recurrence sequences…
Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…
Repeated integration is a major topic of integral calculus. In this article, we study repeated integration. In particular, we study repeated integrals and recurrent integrals. For each of these integrals, we develop reduction formulae for…
Given the congruence lattice L of a finite algebra A with a Mal'cev term, we look for those sequences of operations on L that are sequences of higher commutator operations of expansions of A. The properties of higher commutators proved so…
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…
The article deals with a kind of recursive function templates in C++, where the recursion is realized corresponding template parameters to achieve better computational performance. Some specialization of these template functions ends the…
We will derive a function that eliminates any sequence of equidistant numbers from the integer numbers, then we will derive its inverse. Then we will use the Sequence elimination function to eliminate the multiples of the prime numbers from…
Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…
For an arbitrary ideal I in a local ring R and a finitely generated R-module M, we prove a formula expressing each generalized multiplicity sequence c_k(I,M) as a linear combination of certain local multiplicities. As a consequence, when M…
We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…
The aim of this paper is to present a new simple recurrence for Appell and Sheffer sequences in terms of the linear functional that defines them, and to explain how this is equivalent to several well-known characterizations appearing in the…
After defining a notion of $\epsilon$-density, we provide for any real algebraic number $\alpha$ an estimate of the smallest $\epsilon$ such that for each $m>1$ the set of vectors of the form $(t,t\alpha,...,t\alpha^{m-1})$ for $t\in\R$ is…
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…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
For every complex number $x$, let $\Vert x\Vert_{\mathbb{Z}}:=\min\{|x-m|:\ m\in\mathbb{Z}\}$. Let $K$ be a number field, let $k\in\mathbb{N}$, and let $\alpha_1,\ldots,\alpha_k$ be non-zero algebraic numbers. In this paper, we completely…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
We study optimal decision policies for integer linear programs with a fixed feasible set and varying cost vectors, represented as linear decision trees. Once synthesized for a given feasible set, they return an optimal solution for any…
We derive new reduction formulas for the incomplete beta function and the Lerch transcendent in terms of elementary functions. As an application, we calculate some new integrals. Also, we use these reduction formulas to test the performance…
In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…