Related papers: Random Fibonacci Words via Clone Schur Functions
Let $(B,\|\cdot\|)$ be a Banach space, $(\Omega,\mathcal{F},P)$ a probability space and $L^0(\mathcal{F},B)$ the set of equivalence classes of strong random elements (or strongly measurable functions) from $(\Omega,\mathcal{F},P)$ to…
Zeckendorf's theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers; this result has been generalized to many recurrence relations, especially those arising from linear recurrences with…
Let $\xi_0,\xi_1,\ldots$ be independent identically distributed complex- valued random variables such that $\mathbb{E}\log(1+|\xi _0|)<\infty$. We consider random analytic functions of the form…
We provide a framework for studying the interplay between concordance and positive mutation and identify some of the basic structures relating the two. The fundamental result in understanding knot concordance is the structure theorem proved…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
Let $P_{\alpha} f(x,t)$ be the Caffarelli-Silvestre extension of a smooth function $f(x): \mathbb{R}^n \rightarrow \mathbb{R}^{n+1}_+:=\mathbb{R}^n\times (0,\infty).$ The purpose of this article is twofold. Firstly, we want to characterize…
Given an infinite word, enumerating its factors is an important exercise for understanding the structure of the word. The process of finding all the factors is quite tricky for two-dimensional words. In this paper, two possible ways of…
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…
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
We suggest an optical method which tests a nonclassical feature with a coherent state input. The test is designed with a multiplexer of on/off detectors and post-selection, adopting sub-binomiality as a nonclassical feature, replacing…
It is well known, that Fr\'echet means on non-Euclidean spaces may exhibit nonstandard asymptotic rates depending on curvature. Even for distributions featuring standard asymptotic rates, there are non-Euclidean effects, altering finite…
Recent work on recurrence in quantum walks has provided a representation of Schur functions in terms of unitary operators. We propose a generalization of Schur functions by extending this operator representation to arbitrary operators on…
Statistical methods for automatically identifying dependent word pairs (i.e. dependent bigrams) in a corpus of natural language text have traditionally been performed using asymptotic tests of significance. This paper suggests that Fisher's…
Consider a generalized time-dependent P\'olya urn process defined as follows. Let $d\in \mathbb{N}$ be the number of urns/colors. At each time $n$, we distribute $\sigma_n$ balls randomly to the $d$ urns, proportionally to $f$, where $f$ is…
We study synchronizing automata with the shortest reset words of relatively large length. First, we refine the Frankl-Pin result on the length of the shortest words of rank $m$, and the B\'eal, Berlinkov, Perrin, and Steinberg results on…
Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $\mathsf{F}_\lambda$ arise in the context of $\mathfrak{sl}(2)$ higher spin six vertex models, and are multiparameter deformations of the classical Hall-Littlewood…
The limiting shape of the random Young diagrams associated with an inhomogeneous random word is identified as a multidimensional Brownian functional. This functional is identical in law to the spectrum of a random matrix. The Poissonized…
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…
Just as the definition of factorial Schur functions as a ratio of determinants allows one to show that they satisfy a Jacobi-Trudi-type identity and have an explicit combinatorial realisation in terms of semistandard tableaux, so we offer…
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…