In [BS] Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation.
Let $f_{τ;r}(n)$ be the number of $1\mn3\mn2$-avoiding permutations on $n$ letters that contain exactly $r$ occurrences of $τ$, where $τ$ a generalized pattern on $k$ letters. Let $F_{τ;r}(x)$ and $F_τ(x,y)$ be the generating functions defined by $F_{τ;r}(x)=\sum_{n\geq0} f_{τ;r}(n)x^n$ and $F_τ(x,y)=\sum_{r\geq0}F_{τ;r}(x)y^r$. We find an explicit expression for $F_τ(x,y)$ in the form of a continued fraction for where $τ$ given as a generalized pattern; $τ=12\mn3\mn...\mn k$, $τ=21\mn3\mn...\mn k$, $τ=123... k$, or $τ=k... 321$. In particularly, we find $F_τ(x,y)$ for any $τ$ generalized pattern of length 3. This allows us to express $F_{τ;r}(x)$ via Chebyshev polynomials of the second kind, and continued fractions.
Inspired by Viennot's observation that matching polynomials are numerators of branched continued fractions we present a proof of the Heilmann-Lieb Theorem.
We show that certain Riordan arrays have generating functions that can be expressed as continued fractions of Jacobi and Thron type. We investigate the inverses of such arrays, which in certain circumstances can also have generating functions representable as continued fractions. Links to orthogonal polynomial moment sequences, and to Laurent biorthogonal polynomials are developed. We show that certain Riordan group involutions can be defined by continued fractions. We also show how simple transformations of the Jacobi continued fractions can lead to exponential Riordan arrays. Finally, by way…
We prove a continued fraction expansion for the reciprocal of a certain $q$-series. All the specialists in the world are asked whether it is new or not.
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions, including for binary and n-ary partitions.
Sulanke and Xin developed a continued fraction method that applies to evaluate Hankel determinants corresponding to quadratic generating functions. We use their method to give short proofs of Cigler's Hankel determinant conjectures, which were proved recently by Chang-Hu-Zhang using direct determinant computation. We find that shifted periodic continued fractions arise in our computation. We also discover and prove some new nice Hankel determinants relating to lattice paths with step set $\{(1,1),(q,0), (\ell-1,-1)\}$ for integer parameters $m,q,\ell$. Again shifted periodic continued fraction…
The Hankel transform of an integer sequence is a much studied and much applied mathematical operation. In this note, we extend the notion in a natural way to sequences of $d$ integer sequences. We explore links to generalized continued fractions in the context of $d$-orthogonal sequences.
In a recent paper G. Bhatnagar has given simple proofs of some of Ramanujan's continued fractions. In this note we show that some variants of these continued fractions are generating functions of q-Schroeder-like numbers.
Using ordinary and exponential generating functions, we explore the reversion of power series defined by $2$nd order recurrences. We express the reversions in terms of Jacobi and Thron continued fractions. We find relations with Eulerian expressions using a transformation of continued fractions.
We describe how to represent Rosen continued fractions by paths in a class of graphs that arise naturally in hyperbolic geometry. This representation gives insight into Rosen's original work about words in Hecke groups, and it also helps us to identify Rosen continued fraction expansions of shortest length.
We prove a continued fraction expansion for a certain $q$-tangent function that was conjectured by the present writer, then proved by Fulmek, now in a completely elementary way.
In this note, we study a family of subgraphs of the Farey graph, denoted as $\mathcal{F}_N$ for every $N\in\mathbb{N}.$ We show that $\mathcal{F}_N$ is connected if and only if $N$ is either equal to one or a prime power. We introduce a class of continued fractions referred to as $\mathcal{F}_N$-continued fractions for each $N>1.$ We establish a relation between $\mathcal{F}_N$-continued fractions and certain paths from infinity in the graph $\mathcal{F}_N.$ We discuss existence and uniqueness of $\mathcal{F}_N$-continued fraction expansions of real numbers.
We present family of automatic sequences that define algebraic continued fractions in characteristic 2. This family is constructed from ultimately period words and contains the period-doubling sequence.
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the continued fractions as well as the Euclidean division algorithm. We apply our findings to establish results on sums of squares, palindromic continued fractions, Markov numbers and other statements in elementary number theory.
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our Guess'n'Prove method, in which we exploit the structure of automata, for proving some of our conjectures in special cases.
It has been known that the Hosoya index of caterpillar graph can be calculated as the numerator of the simple continued fraction. Recently, the author \cite{Komatsu2020} introduces a more general graph called caterpillar-bond graph and shows that its Hosoya index can be calculated as the numerator of the general continued fraction. In this paper, we show how the Hosoya index of the graph with non-uniform ring structure can be calculated from the negative continued fraction. We also give the relation between some radial graphs and multidimensional continued fractions in the sense of the Hosoya …
The Hankel determinants of a given power series $f$ can be evaluated by using the Jacobi continued fraction expansion of $f$. However the existence of the Jacobi continued fraction needs that all Hankel determinants of $f$ are nonzero. We introduce {\it Hankel continued fraction}, whose existene and unicity are guaranteed without any condition for the power series $f$. The Hankel determinants can also be evaluated by using the Hankel continued fraction. It is well known that the continued fraction expansion of a quadratic irrational number is ultimately periodic. We prove a similar result for …
We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections appear when extending these theorems for elements of the modular group $PSL(2,\mathbb{Z})$. These polygon dissections are interpreted as walks in the Farey tessellation. The combinatorial model of continued fractions can be further developed to obtain a canonical presentation of elements of $PSL(2,\mathbb{Z})$.
We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo $p$.
Given a positive integer $N$ and $x$ irrational between zero and one, an $N$-continued fraction expansion of $x$ is defined analogously to the classical continued fraction expansion, but with the numerators being all equal to $N$. Inspired by Sturmian sequences, we introduce the $N$-continued fraction sequences $ω(x,N)$ and $\hatω(x,N)$, which are related to the $N$-continued fraction expansion of $x$. They are infinite words over a two letter alphabet obtained as the limit of a directive sequence of certain substitutions, hence they are $S$-adic sequences. When $N=1$, we are in the case of th…
For cluster algebras from surfaces, there is a known formula for cluster variables and F-polynomials in terms of the perfect matchings of snake graphs. If the cluster algebra has trivial coefficients, there is also a known formula for cluster variables in terms of continued fractions. In this paper, we extend this result to cluster algebras with principal coefficients by producing a formula for the F-polynomials in terms of continued fractions.
In this paper, we investigate several infinite products with vanishing Taylor coefficients in arihmetic progressions. These infinite products are closely related to the Rogers--Ramanujan continued fraction. Moreover, a handful of new identities involving Ramanujan's parameters will be established.
We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To a continued fraction $[a_1,a_2,\ldots,a_n]$, we associate a snake graph $\mathcal{G}[a_1,a_2,\ldots,a_n]$ such that the continued fraction is the quotient of the number of perfect matchings of $\mathcal{G}[a_1,a_2,\ldots,a_n]$ and $\mathcal{G}[a_2,\ldots,a_n]$. We also show that snake graphs are in bijection with continued fractions. We then apply this conn…
Repeatedly folding a strip of paper in half and unfolding it in straight angles produces a fractal: the dragon curve. Shallit, van der Poorten and others showed that the sequence of right and left turns relates to a continued fraction that is also a simple infinite series. We construct a Mahler function from two functions of Dilcher and Stolarsky with similar properties. It produces a predictable irregular continued fraction that admits a regular continued fraction and a shape resembling the dragon curve. Furthermore, we discuss numerous variations on this theme.
