Related papers: Counting words with Laguerre series
We present an algorithm which, for given $n$, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set $\{S,K\}$ of primitive combinators, requiring exactly $n$ normal-order reduction steps to…
This paper analyzes a method to approximate the first passage time probability density function which turns to be particularly useful if only sample data are available. The method relies on a Laguerre-Gamma polynomial approximation and…
Let A be an infinite set of generators for a group G, and let L_A(r) denote the number of elements of G whose word length with respect to A is exactly r. The purpose of this note is to determine all growth functions L_A(r) associated to…
In this paper, we consider the problem of avoiding a single vincular pattern of length three by derangements in the flattened sense and find explicit formulas for the generating functions enumerating members of each corresponding avoidance…
Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingr\'imsson [BS]. A POGP p is a GP some of…
We introduce a generalization $G^{(\alpha)}(X)$ of the truncated logarithm $\mathcal{L}_1(X) = \sum_{k=1}^{p-1}X^k/k$ in characteristic $p$, which depends on a parameter $\alpha$. The main motivation of this study is $G^{(\alpha)}(X)$ being…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
In this paper, we study generating functions of Erd\'{e}lyi's multivariate Laguerre polynomials $L_{n_1,\cdots,n_k}^{(\alpha)}(x_1,\cdots,x_k)$ with a varying complex parameter. Our main result is a multiple generating function from which…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
A quantitative method is suggested, where meanings of words, and grammatic rules about these, of a vocabulary are represented by real numbers. People meet randomly, and average their vocabularies if they are equal; otherwise they either…
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan…
We investigate the intertwining of Laguerre processes of parameter $\alpha$ in different dimensions. We introduce a Feller kernel that depends on $\alpha $ and intertwines the $\alpha$-Laguerre process in $N+1$ dimensions and that in $N$…
The use of language models for generating lyrics and poetry has received an increased interest in the last few years. They pose a unique challenge relative to standard natural language problems, as their ultimate purpose is reative, notions…
Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word $w$ of length $n$ over an alphabet of cardinality $k$, $w$ can be…
We present a new method for producing series for $1/\pi$ and other constants using Legendre's relation, starting from a generation function that can be factorised into two elliptic $K$'s; this way we avoid much of modular theory or creative…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…