Related papers: Snake graphs and continued fractions
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
In this paper we establish properties of independence for the continued fraction expansions of two algebraic numbers. Roughly speaking, if the continued fraction expansions of two irrational algebraic numbers have the same long sub-word,…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
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…
This paper present the important role that random system with complete connections played in solving the Gauss problem associated to the regular continued fractions. Hence, using the ergodic behavior of homogeneous random system with…
The Kernel Complex Lemma states that given commutative diagram with exact rows and exact columns which covers the region under a $\Gamma$-shape, then the kernel sequence on the top and the kernel sequence at the left have in each position…
For uniformly chosen random $\alpha \in [0,1]$, it is known the probability the $n^{\rm th}$ digit of the continued-fraction expansion, $[\alpha]_n$ converges to the Gauss-Kuzmin distribution $\mathbb{P}([\alpha]_n = k) \approx \log_2 (1 +…
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…
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,…
We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.
We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…
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…
A contiguous relation for complementry pairs of very well poised balanced ${}_{10}\phi_9$ basic hypergeometric functions is used to derive an explict expression for the associated continued fraction. This generalizes the continued fraction…
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…
We introduce and study in detail a special class of backward continued fractions that represents a generalization of R\'enyi continued fractions. We investigate the main metrical properties of the digits occurring in these expansions and we…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…
We show that the graph of normalized elliptic Dedekind sums is dense in its image for arbitrary imaginary quadratic fields, generalizing a result of Ito in the Euclidean case. We also derive some basic properties of Martin's continued…
We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this…
In this partly expository paper, we discuss three results. (1) That the two-sided continued fraction of the normalized square root (an important part of the SQUFOF algorithm) has several very attractive properties - periodicity, a symmetry…