Related papers: On the representability of sequences as constant t…
For a fixed prime power $q$, let $\text{GL}_\bullet(q)$ denote the family of groups $\text{GL}_N(q)$ for $N \in \mathbb{Z}_{\geq 0}$. In this paper we study the $\mathbb{C}$-algebra of "stable" class functions of $\text{GL}_\bullet(q)$, and…
Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, a hypergeometric sequence $\langle u_n \rangle_{n=0}^{\infty}$ is one that satisfies a…
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called a hypergeometric term if both…
In this paper, we study the three-term nested recurrence relation $B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3))$ subject to initial conditions where the first $N$ terms are the integers $1$ through $N$. This recurrence is the three-term analog…
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…
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…
This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…
Any three hypergeometric series whose respective parameters, a, b and c, differ by integers satisfy a linear relation with coefficients that are rational functions of a, b, c and the variable x. These relations are called three-term…
A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…
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…
A Chen generating series, along a path and with respect to $m$ differential forms,is a noncommutative series on $m$ letters and with coefficients which are holomorphic functionsover a simply connected manifold in other words a series with…
In this paper we generalize the concept of a quasi-Cauchy sequence to a concept of a $p$-quasi-Cauchy sequence for any fixed positive integer $p$. For $p=1$ we obtain some earlier existing results as a special case. We obtain some…
Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…
The purpose of the paper is three-fold: (a) we prove that every sequence which is a multidimensional sum of a balanced hypergeometric term has an asymptotic expansion of Gevrey type-1 with rational exponents, (b) we construct a class of…
We study the category Cstabm of measurable cones and measurable stable functions, which is a denotational model of an higher-order language with continuous probabilities and full recursion. We look at Cstabm as a model for discrete…
Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…
Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…