Related papers: Continued fractions and generalized patterns

We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

For positive integers $u$ and $v$, let $L_u=\begin{bmatrix} 1 & 0 \\ u & 1 \end{bmatrix}$ and $R_v=\begin{bmatrix} 1 & v \\ 0 & 1 \end{bmatrix}$. Let $S_{u,v}$ be the monoid generated by $L_u$ and $R_v$, and $G_{u,v}$ be the group generated…

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…

A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…

Michael Somos conjectured a relation between Hankel determinants whose entries $\frac 1{2n+1}\binom{3n}n$ count ternary trees and the number of certain plane partitions and alternating sign matrices. Tamm evaluated these determinants by…

Legendre found that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. Similarly, it is shown here that the continued fraction expansion of $\sqrt…

This version corrects minor inaccuracies and missprints. One drawing is changed. We continue to study some arithmetical properties of Farey sequences by the method introduced by F.Boca, C.Cobeli and A.Zaharescu (2001). Let $\Phi_{Q}$ be the…

We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…

We study the distribution and the popularity of some patterns in $k$-ary faro words, i.e. words over the alphabet $\{1, 2, \ldots, k\}$ obtained by interlacing the letters of two nondecreasing words of lengths differing by at most one. We…

The author (Bull. Math. Anal. App. 6(4)(2014):1-15), introduced a new fractional derivative, \[{}^\rho \mathcal{D}_a^\alpha f (x) = \frac{\rho^{\alpha-n+1}}{\Gamma({n-\alpha})} \, \bigg(x^{1-\rho} \,\frac{d}{dx}\bigg)^n \int^x_a…

We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in…

We introduce the concept of Minkowski normality, a different type of normality for the regular continued fraction expansion. We use the ordering \[ \frac{1}{2},\quad \frac{1}{3}, \frac{2}{3},\quad \frac{1}{4}, \frac{3}{4},\frac{2}{5},…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

An elementary but useful fact is that the numerator of the difference of two consecutive Farey fractions is equal to one. For triples of consecutive fractions the numerators of the differences are well understood and have applications to…

We study different fractional extensions of the Poisson process and generalized counting processes by introducing time-change represented by the inverse to the sums of stable and tempered stable subordinators. We state the governing…

A Catalan word $w$ is said to be flattened if the subsequence of $w$ obtained by taking the first letter of each weakly increasing run is nondecreasing. Let $\mathcal{F}_n$ denote the set of flattened Catalan words of length $n$, which has…

Let $\sigma$ be a permutation on $n$ letters. We say that a permutation $\tau$ is an even (resp. odd) $k$th root of $\sigma$ if $\tau^k=\sigma$ and $\tau$ is an even (resp. odd) permutation. In this article, we obtain generating functions…

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…