Related papers: Enumerating runs, valleys, and peaks in Catalan wo…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…
In this paper we build on earlier observations and theory regarding word length frequency and sequential distribution to develop a mathematical characterization of some of the language features distinguishing isometrically lineated text…
We calculate moments of the so-called Kesten distribution by means of the expansion of the denominator of the density of this distribution and then integrate all summands with respect to the semicircle distribution. By comparing this…
In this paper, we give a bijection between rooted labeled ordered forests with a selected subset of their leaves and the regions of the type $C$ Catalan arrangement in $\R^n$. We thus obtain a bijective proof of the well-known enumeration…
We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…
By means of a variational approach we find new series representations both for well known mathematical constants, such as $\pi$ and the Catalan constant, and for mathematical functions, such as the Riemann zeta function. The series that we…
Ascent sequences of length $n$ avoiding the pattern $021$ are enumerated by the $n$-th Catalan number $C_n=\frac{1}{n+1}\binom{2n}{n}$. In this paper, we extend this result and enumerate ascent sequences avoiding $\{021,\tau\}$, where…
We study the stability of two coexisting languages (Catalan and Spanish) in Catalonia (North-Eastern Spain), a key European region in political and economic terms. Our analysis relies on recent, abundant empirical data that is studied…
The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…
In 1996, Stanley extended the classical Catalan arrangement and semiorder arrangement, which are called the Catalan-type arrangement $\mathcal{C}_{n,A}$ and the semiorder-type arrangement $\mathcal{C}_{n,A}^*$ in this paper. By establishing…
Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…
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…
We present a computationally-grounded word similarity dataset based on two well-known Natural Language Processing resources; text corpora and knowledge bases. This dataset aims to fulfil a gap in psycholinguistic research by providing a…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as established in this paper, we obtain a complete $\des$-Wilf…
Due to the success of pre-trained language models, versions of languages other than English have been released in recent years. This fact implies the need for resources to evaluate these models. In the case of Spanish, there are few ways to…
A recursively palindromic (RP) word is one that is a palindrome and whose left half-word and right half-word are each RP. Thus ABACABA is, and MADAM is not, an RP word. We count RP words of given length over a finite alphabet and RP…
This paper presents compact notations for concentration inequalities and convenient results to streamline probabilistic analysis. The new expressions describe the typical sizes and tails of random variables, allowing for simple operations…
We give asymptotic formulas for the number of balanced words whose slope $\alpha$ and intercept $\rho$ lie in a prescribed rectangle. They are related to uniform distribution of Farey fractions and Riemann Hypothesis. In the general case,…