相关论文: Patterns and Fractions

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…

By applying the MC algorithm and the Bauer-Muir transformation for continued fractions, in this paper we shall give six examples to show how to establish an infinite set of continued fraction formulas for certain Ramanujan-type series, such…

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…

We prove some new modular identities for the Rogers\textendash Ramanujan continued fraction. For example, if $R(q)$ denotes the Rogers\textendash Ramanujan continued fraction, then…

Ramanujan recorded four reciprocity formulas for the Roger-Ramanujan continued fraction. Two reciprocity formulas each are also associated with the Ramanujan--G\"ollnitz--Gordon continued fraction and a level-13 analog of the…

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…

A permutiple is a number which is an integer multiple of some permutation of its digits. A well-known example is 9801 since it is an integer multiple of its reversal, 1089. In this paper, we consider the permutiple problem in an entirely…

In this paper, we study the distribution of consecutive patterns in the set of 123-avoiding permutations and the set of 132-avoiding permutations, that is, in $\mathcal{S}_n(123)$ and $\mathcal{S}_n(132)$. We first study the distribution of…

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

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…

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

We explain in detail how to accelerate continued fractions (for constants as well as for functions) using the method used by R.~Ap\'ery in his proof of the irrationality of $\zeta(3)$. We show in particular that this can be applied to a…

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

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…

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…