English
Related papers

Related papers: Continued fractions for permutation statistics

200 papers

Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…

Combinatorics · Mathematics 2021-12-23 Zhicong Lin , Jing Liu

We give a simple combinatorial proof of a formula that extends a result by Grigorchuk (rediscovered by Cohen) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of `bumps'…

Combinatorics · Mathematics 2008-06-05 Laurent Bartholdi

The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…

Combinatorics · Mathematics 2007-05-23 Alexander Gnedin , Grigori Olshanski

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…

Discrete Mathematics · Computer Science 2016-06-28 Jean-Luc Baril , Vincent Vajnovszki

Recently Alexandersson and Getachew proved some multivariate generalizations of a formula for enumerating signed excedances in derangements. In this paper we first relate their work to a recent continued fraction for permutations and…

Combinatorics · Mathematics 2023-10-10 Yanni Pei , Jiang Zeng

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

Combinatorics · Mathematics 2026-04-10 Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian

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…

Combinatorics · Mathematics 2019-08-23 Ilke Canakci , Ralf Schiffler

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

Combinatorics · Mathematics 2024-03-11 Manosij Ghosh Dastidar , Michael Wallner

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Number Theory · Mathematics 2011-02-21 S. G. Dani , Arnaldo Nogueira

In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…

General Mathematics · Mathematics 2026-04-14 Nikita Kalinin , Takao Komatsu

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

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…

Combinatorics · Mathematics 2010-12-14 G. Berkolaiko , J. M. Harrison , M. Novaes

We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is…

Combinatorics · Mathematics 2011-10-31 Eric Fusy

In this paper we introduce a generalization of palindromic continued fractions as studied by Adamczewski and Bugeaud. We refer to these generalized palindromes as $m$-palindromes, where $m$ ranges over the positive integers. We provide a…

Number Theory · Mathematics 2017-01-27 David M. Freeman

Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin…

Number Theory · Mathematics 2025-02-11 Ignazio Longhi , Nadir Murru , Francesco Maria Saettone

The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…

Number Theory · Mathematics 2022-09-20 Michele Battagliola , Nadir Murru , Giordano Santilli

We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…

Number Theory · Mathematics 2012-11-22 Avraham Bourla

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Combinatorics · Mathematics 2007-05-23 Sergey Avgustinovich , Sergey Kitaev

A well known method for convergence acceleration of continued fraction $\K(a_n/b_n)$ is to use the modified approximants $S_n(\omega_n)$ in place of the classical approximants $S_n(0)$, where $\omega_n$ are close to tails $f^{(n)}$ of…

Numerical Analysis · Mathematics 2012-03-06 Rafał Nowak