Related papers: Factor frequencies in generalized Thue-Morse words

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

We investigate pointwise convergence of entangled ergodic averages of Dunford-Schwartz operators $T_0,T_1,\ldots, T_m$ on a Borel probability space. These averages take the form \[ \frac{1}{N^k}\sum_{1\leq n_1,\ldots, n_k\leq N}…

Consider the following dynamic factor model: $\mathbf{R}_t=\sum_{i=0}^q \mathbf{\Lambda}_i \mathbf{f}_{t-i}+\mathbf{e}_t,t=1,...,T$, where $\mathbf{\Lambda}_i$ is an $n\times k$ loading matrix of full rank, $\{\mathbf{f}_t\}$ are i.i.d.…

The generalized Morse wavelets are shown to constitute a superfamily that essentially encompasses all other commonly used analytic wavelets, subsuming eight apparently distinct types of analysis filters into a single common form. This…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

We have translated fractional Brownian motion (FBM) signals into a text based on two ''letters'', as if the signal fluctuations correspond to a constant stepsize random walk. We have applied the Zipf method to extract the $\zeta '$ exponent…

In this paper, we introduce a way to generalize the Euler's gamma function as well as some related special functions. With a given polynomial in one variable $f(t)\ge 0$, we can associate a function, so-called "gamma function associated…

Let $\mu$ be a positive Borel measure on the interval $[0,1)$. For $\alpha>0$, the generalized Hankel matrix $\mathcal{H}_{\mu, \alpha}=(\mu_{n, k, \alpha})_{n, k \geq 0}$ with entries $\mu_{n, k, \alpha}=\int_{[0,1)}…

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

In this work we prove the local multiplicity at most one theorem underlying the definition and theory of local $\gamma$-, $\epsilon$- and $L$-factors, defined by virtue of the generalized doubling method, over any local field of…

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

The notion of palindromic length of a finite word, as well as an infinite word, was first introduced by Frid, Puzynina and Zamboni\cite{FRID2013737}. They conjectured that if the palindromic length of an infinite word is bounded, then this…

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…

Defant and Kravitz introduced generalizations of West's stack-sorting map $s$ from permutations to finite words. This raises questions as to how such generalizations could be applied in the field of combinatorics on words. The…

In this paper, I introduce a simple method of computing relative word frequencies for authorship attribution and similar stylometric tasks. Rather than computing relative frequencies as the number of occurrences of a given word divided by…

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.

Recently, there has been some interest in values of arithmetical functions on members of special sequences, such as Euler's totient function $\phi$ on factorials, linear recurrences, etc. In this article, we investigate, for given positive…

A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as…

For a positive integer $m$ and a subgroup $\Lambda$ of the unit group $(\mathbb{Z}/m\mathbb{Z})^\times$, the corresponding generalized Kloosterman sum is the function $K(a,b,m,\Lambda) = \sum_{u \in \Lambda}e(\frac{au + bu^{-1}}{m})$.…

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…