English
Related papers

Related papers: Continued fractions and generalized patterns

200 papers

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…

Classical Analysis and ODEs · Mathematics 2023-03-29 Tomas Sauer , Yuan Xu

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…

Combinatorics · Mathematics 2019-02-20 Ilke Canakci , Ralf Schiffler

We consider a family $\{\tau_m:m\geq 2\}$ of interval maps introduced by Hei-Chi Chan [5] as generalizations of the Gauss transformation. For the continued fraction expansion arising from $\tau_m$, we solve its Gauss-Kuzmin-type problem by…

Number Theory · Mathematics 2014-05-16 Dan Lascu

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

The author \mbox{(Appl. Math. Comput. 218(3):860-865, 2011)} introduced a new fractional integral operator given by, \[ \big({}^\rho \mathcal{I}^\alpha_{a+}f\big)(x) = \frac{\rho^{1- \alpha }}{\Gamma({\alpha})} \int^x_a \frac{\tau^{\rho-1}…

Classical Analysis and ODEs · Mathematics 2014-10-15 Udita N. Katugampola

In [GM] Guibert and Mansour studied involutions on n letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary pattern on k letters. They also established a bijection between 132-avoiding…

Combinatorics · Mathematics 2007-05-23 O. Guibert , T. Mansour

Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingr\'imsson [BS]. A POGP p is a GP some of…

Combinatorics · Mathematics 2007-05-23 S. Kitaev , T. Mansour

Considering an arbitrary pair of distinct and non constant polynomials, $a$ and $b$ in $\mathbb{F}_2[t]$, we build a continued fraction in $\mathbb{F}_2((1/t))$ whose partial quotients are only equal to $a$ or $b$. In a previous work of the…

Number Theory · Mathematics 2022-04-05 Yining Hu , Alain Lasjaunias

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…

Number Theory · Mathematics 2021-06-29 S. Kushwaha , R. Sarma

Recently, A. I. Aptekarev and his collaborators found a sequence of rational approximations to Euler's constant $\gamma$ defined by a third-order homogeneous linear recurrence. In this paper, we give a new interpretation of Aptekarev's…

Number Theory · Mathematics 2013-12-31 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…

Quantum Physics · Physics 2015-06-10 Vincenzo Tamma , Heyi Zhang , Xuehua He , Augusto Garuccio , Yanhua Shih

We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…

Combinatorics · Mathematics 2024-08-14 Amanda Burcroff , Nicholas Ovenhouse , Ralf Schiffler , Sylvester W. Zhang

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

Let $r\geq 3$ be a positive integer and $\mathbb{F}_q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=\tau\circ\sigma_M\circ\tau^{-1}$ where $\tau$ is a…

Information Theory · Computer Science 2022-12-29 Wei Lu , Xia Wu , Yufei Wang , Xiwang Cao

For \alpha in the interval [0,1], we consider the one-parameter family of \alpha-continued fraction maps, which include the Gauss map (\alpha=1) and the nearest integer (\alpha=1/2) and by-excess (\alpha=0) continued fraction maps. To each…

Dynamical Systems · Mathematics 2007-05-23 Laura Luzzi , Stefano Marmi , Hitoshi Nakada , Rie Natsui

We state and prove three general formulas allowing to transform formal finite sums into formal continued fractions and apply them to generalize certain expansions in continued fractions given by Hone and Varona.

Number Theory · Mathematics 2020-06-18 Daniel Duverney , Takeshi Kurosawa , Iekata Shiokawa

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

Number Theory · Mathematics 2021-07-01 Martin Bunder , Joseph Tonien