Related papers: Patterns and Fractions
We present here two classes of infinite series and the associated continued fractions involving $\pi$ and Catalan's constant $G$ based on the work of Euler and Ramanujan. A few sundry continued fractions are also given.
In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…
We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…
We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…
We show that two notions of continued fraction normality, one where overlapping occurrences of finite patterns are counted as distinct occurrences, and another where only disjoint occurrences are counted as distinct, are identical. This…
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…
Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…
We investigate a collection of orthonormal functions that encodes information about the continued fraction expansion of real numbers. When suitably ordered these functions form a complete system of martingale differences and are a special…
In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…
Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly…
Relations involving the Rogers-Ramanujan continued fractions $R(q),$ $R(q^3 ),$ and $R(q^4)$ are used to find new generating functions and congruences modulo 5 and 25 for 3-core, 4-core, 4-regular, and colored partition functions.
This paper aims to introduce high school students to the intriguing world of continued fractions, a mathematical concept that provides a unique representation of numbers. The study focuses on the exploration and development of the…
In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…
We give an explicit formula for the number of permutations avoiding cyclically a consecutive pattern in terms of the spectrum of the associated operator of the consecutive pattern. As an example, the number of cyclically consecutive…
We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…
We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…
A permutation is said to be cycle-alternating if it has no cycle double rises, cycle double falls or fixed points; thus each index $i$ is either a cycle valley ($\sigma^{-1}(i)>i<\sigma(i)$) or a cycle peak ($\sigma^{-1}(i)<i>\sigma(i)$).…