Related papers: Subword counting and the incidence algebra
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A considerable amount of work has been done on this problem, but the…
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…
We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word appears as a subsequence of another finite word. The finite…
In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…
The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…
Words in some natural languages can have a composite structure. Elements of this structure include the root (that could also be composite), prefixes and suffixes with which various nuances and relations to other words can be expressed.…
We continue to investigate combinatorial properties of functions $f_m$ and $c_m$ considered in our previous papers. They depend on an initial arithmetic function $f_0$. In this paper, the values of $f_0$ are the binomial coefficients. We…
We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…
Given a C*-algebra B, a closed *-subalgebra A contained in B, and a partial isometry S in B which "interacts" with A in the sense that S*aS = H(a)S*S and SaS* = V(a)SS*, where V and H are positive linear operators on A, we derive a few…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
We study the expansions of permutation statistics in the basis of functions counting occurrences of a fixed pattern in a permutation. We show the finiteness of these pattern expansions for a class of permutation statistics including the…
For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
This article presents a pattern-based language designed to select (a set of) subterms of a given term in a concise and robust way. Building on this language, we implement a single-step rewriting tactic in the Isabelle theorem prover, which…
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…