English
Related papers

Related papers: Continued fractions and generalized patterns

200 papers

This paper presents a stochastic approach to theorems concerning the behavior of iterations of the Bernstein operator $B_n$ taking a continuous function $f \in C[0,1]$ to a degree-$n$ polynomial when the number of iterations $k$ tends to…

Probability · Mathematics 2016-01-19 Takis Konstantopoulos , Linglong Yuan , Michael A. Zazanis

We study continued logarithms as introduced by Bill Gosper and studied by J. Borwein et. al.. After providing an overview of the type I and type II generalizations of binary continued logarithms introduced by Borwein et. al., we focus on a…

Number Theory · Mathematics 2016-06-23 Jonathan M. Borwein , Kevin G. Hare , Jason G. Lynch

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

Number Theory · Mathematics 2019-05-21 Menny Aka

Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set $(P, \leq_P)$ by setting $u \leq_P w$ if there is a subword $v$ of $w$ of the same length as $u$ such that…

Combinatorics · Mathematics 2010-05-25 Thomas Langley , Jeffrey Liese , Jeffrey Remmel

We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…

Combinatorics · Mathematics 2023-06-22 Sergi Elizalde

I present and discuss an extremely simple algorithm for expanding a formal power series as a continued fraction. This algorithm, which goes back to Euler (1746) and Viscovatov (1805), deserves to be better known. I also discuss the…

Combinatorics · Mathematics 2023-07-03 Alan D. Sokal

A natural generalization of single pattern avoidance is subset avoidance. A complete study of subset avoidance for the case k=3 is carried out in [SS]. For k>3 situation becomes more complicated, as the number of possible cases grows…

Combinatorics · Mathematics 2007-05-23 T. Mansour

In this short note we prove two elegant generalized continued fraction formulae $$e= 2+\cfrac{1}{1+\cfrac{1}{2+\cfrac{2}{3+\cfrac{3}{4+\ddots}}}}$$ and $$e= 3+\cfrac{-1}{4+\cfrac{-2}{5+\cfrac{-3}{6+\cfrac{-4}{7+\ddots}}}}$$ using elementary…

Number Theory · Mathematics 2019-07-15 Zhentao Lu

A {\it two-dimensional continued fraction expansion} is a map $\mu$ assigning to every $x \in\mathbb R^2\setminus\mathbb Q^2$ a sequence $\mu(x)=T_0,T_1,\dots$ of triangles $T_n$ with vertices $x_{ni}=(p_{ni}/d_{ni},q_{ni}/d_{ni})\in\mathbb…

Number Theory · Mathematics 2017-05-10 Daniele Mundici

Let A_0, A_1 be nonnegative matrices in GL(n+1,Z) such that the subsimplexes A_0[Delta], A_1[Delta] split the standard unit n-dimensional simplex Delta in two. We prove that, for every n=1,2,... and up to the natural action of the symmetric…

Dynamical Systems · Mathematics 2025-06-04 Giovanni Panti

Analytical expressions are derived for the number of fractions with equal numerators in the Farey sequence of order $n$, $F_n$, and in the truncated Farey sequence $F_n^{1/k}$ containing all Farey fractions below $1/k$, with $1\leq k \leq…

Number Theory · Mathematics 2024-07-16 Rogelio Tomas Garcia

Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…

Complex Variables · Mathematics 2009-01-12 Douglas Bowman , James Mc Laughlin

We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…

Number Theory · Mathematics 2012-11-26 Yann Bugeaud

We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a…

Combinatorics · Mathematics 2023-06-22 Sittipong Thamrongpairoj , Jeffrey B. Remmel

Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'\i msson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two…

Combinatorics · Mathematics 2007-05-23 Antonio Bernini , Elisa Pergola

We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…

Combinatorics · Mathematics 2017-01-18 Maxie D. Schmidt

In this paper we recall some results and some criteria on the convergence of matrix continued fractions. The aim of this paper is to give some properties and results of continued fractions with matrix arguments. Then we give continued…

Number Theory · Mathematics 2023-06-22 S. Mennou , A. Chillali , A. Kacha

In the theory of continued fractions, Zaremba's conjecture states that there is a positive integer $M$ such that each integer is the denominator of a convergent of an ordinary continued fraction with partial quotients bounded by $M$. In…

Number Theory · Mathematics 2017-03-14 Michael Coons

Many combinatorial numbers can be placed in the following generalized triangular array $[T_{n,k}]_{n,k\ge 0}$ satisfying the recurrence relation: \begin{equation*}…

Combinatorics · Mathematics 2021-06-02 Bao-Xuan Zhu

A widely used approach to compute the action $f(A)v$ of a matrix function $f(A)$ on a vector $v$ is to use a rational approximation $r$ for $f$ and compute $r(A)v$ instead. If $r$ is not computed adaptively as in rational Krylov methods,…

Numerical Analysis · Mathematics 2021-09-09 Andreas Frommer , Karsten Kahl , Manuel Tsolakis