Related papers: Sequences: Polynomial, C-finite, Holonomic, ...
Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…
In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…
Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Two results on palindromicity of bi-infinite words in a finite alphabet are presented. The first is a simple, but efficient criterion to exclude palindromicity of minimal sequences and applies, in particular, to the Rudin-Shapiro sequence.…
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for…
We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…
Sequential pattern discovery is a well-studied field in data mining. Episodes are sequential patterns describing events that often occur in the vicinity of each other. Episodes can impose restrictions to the order of the events, which makes…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
A new characterization of the generalized Hermite polynomials and of the orthogonal polynomials with respect to the maesure $|x|^\g (1-x^2)^{\a-1/2}dx$ is derived which is based on a "reversing property" of the coefficients in the…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
In this paper we collect some results about arithmetic progressions of higher order, also called polynomial sequences. Those results are applied to $(m,q)$-isometric maps.
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
We study functions which are the pointwise limit of a sequence of holomorphic functions. In one complex variable this is a classical topic, though we offer some new points of view and new results. Some novel results for solutions of…
We consider the space of $C^1$-diffeomorphims equipped with the $C^1$-topology on a three dimensional closed manifold. It is known that there are open sets in which $C^1$-generic diffeomorphisms display uncountably many chain recurrences…
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…
We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial…
In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…