Related papers: Generalizing Zeckendorf's Theorem to Homogeneous L…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
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…
We show that in a parametric family of linear recurrence sequences $a_1(\alpha) f_1(\alpha)^n + \ldots + a_k(\alpha) f_k(\alpha)^n$ with the coefficients $a_i$ and characteristic roots $f_i$, $i=1, \ldots,k$, given by rational functions…
Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…
We study a family of high order Ehrlich-type methods for approximating all zeros of a polynomial simultaneously. Let us denote by $T^{(1)}$ the famous Ehrlich method (1967). Starting from $T^{(1)}$, Kjurkchiev and Andreev (1987) have…
Lagrange's four squares theorem is a classical theorem in number theory. Recently, Z.-W. Sun found that it can be further refined in various ways. In this paper we study some conjectures of Sun and obtain various refinements of Lagrange's…
We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real…
We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
We derive a generalization of the Perron-Frobenius theorem to time-varying row-stochastic matrices as follows: using Kolmogorov's concept of absolute probability sequences, which are time-varying analogs of principal eigenvectors, we…
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
A system of linear equations $L$ is common over $\mathbb{F}_p$ if, as $n\to\infty$, any 2-coloring of $\mathbb{F}_p^n$ gives asymptotically at least as many monochromatic solutions to $L$ as a random 2-coloring. The notion of common linear…
We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…
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…
Several Lebesgue-type decomposition theorems in analysis have a strong relation to the operation called: parallel sum. The aim of this paper is to investigate this relation from a new point of view. Namely, using a natural generalization of…