Related papers: Taffy, Trees, and Tangles
In this note we discuss trees similar to the Calkin-Wilf tree, a binary tree that enumerates all positive rational numbers in a simple way. The original construction of Calkin and Wilf is reformulated in a more algebraic language, and an…
We give two trees allowing to represent all positive rational numbers. These trees can be seen as ternary and quinary analogues of the Calkin-Wilf tree. For each of these two trees, we give recurrence formulas allowing to compute the…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…
This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…
There are two well-known ways to enumerate the positive rational numbers in an infinite binary tree: the Farey/Stern-Brocot tree and the Calkin-Wilf tree. In this brief note, we describe these two trees as `transpose shadows' of a tree of…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
In the present paper, we build a bridge between Conway-Coxeter friezes and rational tangles through the Kauffman bracket polynomials. One can compute a Kauffman bracket polynomials attached to rational links by using Conway-Coxeter friezes.…
In their study of fundamental groups of one-dimensional path-connected compact metric spaces, Cannon and Conner have asked: Is there a tree-like object that might be considered the topological Cayley graph? We answer this question in the…
We prove that the generating functions for the one row/column colored HOMFLY-PT invariants of arborescent links are specializations of the generating functions of the motivic Donaldson-Thomas invariants of appropriate quivers that we…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
In this article, we prove various properties of Calkin-Wilf tree. We also see how the Minkowski question mark function will act on Calkin-Wilf tree and its diagonals.
In this study, we explore a novel approach to demonstrate the countability of rational numbers and illustrate the relationship between the Calkin-Wilf tree and the Stern-Brocot tree in a more intuitive manner. By employing a growth pattern…
We consider the problem of comparing t-structures under the derived McKay correspondence and for tilting equivalences. We relate the t-structures using certain natural torsion theories. As an application, we give a criterion for rationality…
We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the $\mathcal{F}$-tangles of an abstract separation system for very general obstruction sets $\mathcal{F}$. It simultaneously also…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
We describe a number of devices for pulling candy, called taffy pullers,that are related to pseudo-Anosov maps of punctured spheres. Though the mathematical connection has long been known for the two most common taffy puller models, we…
There is a map, defined and studied by Jones, from Thompson's group $F$ to knots. Jones proved that every knot is in the image of this map -- that is, that every knot can be seen as the "knot closure" of a Thompson group element. We…
The Links-Quivers Correspondence predicts that all the symmetric (or antisymmetric) colored HOMFLY-PT polynomials of a link can be recovered from a finite amount of data (a quiver) associated to the link. We give a new geometric proof of…
The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every…