Related papers: Snake graphs and continued fractions
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.
In connection with cluster algebras, snake graphs and q-integers, Kyungyong Lee and Ralf Schiffler recently found a formula for computing the (normalized) Jones polynomials of rational links in terms of continued fraction expansion of…
This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…
The goal of this note is to show that continuous functions may be approximated using scattered translates of the Poisson kernel.
In 1855 H. J. S. Smith proved Fermat's two-square using the notion of palindromic continuants. In his paper, Smith constructed a proper representation of a prime number $p$ as a sum of two squares, given a solution of…
Gosper developed an algorithm for performing arithmetic operations on continued fractions (CFs), getting a CF as the result. Straightforward implementation of the algorithm leads to infinite loops on some inputs. Here we present a modified…
The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…
In this article we present ways to evaluate certain sums, products and continued fractions using tools from the theory of elliptic functions. The specific results appear to be new, although similar ones can be found in the leterature; in…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In this paper we obtain multifractal generalizations of classical results by L\'evy and Khintchin in metrical Diophantine approximations and measure theory of continued fractions. We give a complete multifractal analysis for Stern--Brocot…
Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and…
We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…
We demonstrate that discrete m-functions with eventually periodic continued fraction coefficients have an algebraic relationship to their second solution if and only if the periodic part of the sequence of continued fraction coefficients is…
We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
We prove an analog of Lagrange's Theorem for continued fractions on the Heisenberg group: points with an eventually periodic continued fraction expansion are those that satisfy a particular type of quadratic form, and vice-versa.