Related papers: Self-describing sequences and the Catalan family t…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
We introduce an inductively defined sequence of directed graphs and prove that the number of edges added at step $k$ is equal to the $k$th Catalan number. Furthermore, we establish an isomorphism between the set of edges adjoined at step…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
A new family of stable processes indexed by metric spaces with stationary increments are introduced. They are special cases of a new family of set-indexed stable processes with Chentsov representation. At the heart of the representation, a…
A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $\mathbb{F}_2^n$ such that when each edge is labeled with the sum$\pmod{2}$ of its vertices, every nonzero vector in $\mathbb{F}_2^n$ is the…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
Extending earlier work of R. Donaghey and P. J. Cameron, we investigate some canonical "eigen-sequences" associated with transformations of integer sequences. Several known sequences appear in a new setting: for instance the sequences (such…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
In this paper we show that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers are Hausdorff moment sequences in a unified approach. In…
Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…
A Catalan word $w$ is said to be flattened if the subsequence of $w$ obtained by taking the first letter of each weakly increasing run is nondecreasing. Let $\mathcal{F}_n$ denote the set of flattened Catalan words of length $n$, which has…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential…
Two possible definitions of fixed points in the self-similar analysis of time series are considered. One definition is based on the minimal-difference condition and another, on a simple averaging. From studying stock market time series, one…
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…
We recall the definition and the properties of a moment sequence and recall that all real sequences that have a finite rank of its Hankel matrix (see definition in the sequel) satisfy a homogeneous linear equation with constant…