Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
The number of spanning trees of a graph $G$ is called the {\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit…
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.
A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra…
It is known that the continued fraction expansion of a real number is periodic if and only if the number is a quadratic irrational. In an attempt to generalize this phenomenon to other settings, Jun-Ichi Tamura and Shin-Ichi Yasutomi have…
We study Cantor Staircases in physics that have the Farey-Brocot arrangement for the Q/P rational heights of stability intervals I(Q/P), and such that the length of I(Q/P)is a convex function of 1/P. Circle map staircases and the…
We verify the conjecture that the sixth binary partition function is equal (aside from the initial zero term) to the partial sums of the Stern-Brocot sequence.
A zero-one sequence describes a path through a rooted directed binary tree $T$; it also encodes a real number in $[0,1]$. We regard the level of the external node of $T$ along the path as a function on the unit interval, the silhouette of…
A random binary search tree grown from the uniformly random permutation of $[n]$ is studied. We analyze the exact and asymptotic counts of vertices by rank, the distance from the set of leaves. The asymptotic fraction $c_k$ of vertices of a…
We study infinite paths of Markoff $m$-triples, that is, solutions to the generalised Markoff equation \[ x^2+y^2+z^2=3xyz+m, \] with $m>0$, with at least two $k$-Fibonacci components. First, we obtain a complete classification of Markoff…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…
For a subspace $W$ of a vector space $V$ of dimension $n$, the Schur-product space $W^{\langle k\rangle}$ for $k \in \mathbb{N}$ is defined to be the span of all vectors formed by the component-wise multiplication of $k$ vectors in $W$. It…
Andrei et al. have shown in 2000 that the graph $\boldsymbol{\mathrm{C}}$ of the Collatz function starting with root $8$ after the initial loop is an infinite binary tree $\boldsymbol{A}(8)$. According to their result they gave a…
Avraham et al. [AFK+15] presented an alternative approach to parametric search, called \emph{bifurcation}, that performs faster under certain circumstances. Intuitively, when the underlying decider execution can be rolled back cheaply and…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
W. Magnus introduced a particular differential equation characterizing the logarithm of the solution of linear initial value problems for linear operators. The recursive solution of this differential equation leads to a peculiar Lie series,…
We introduce a correspondence between phylogenetic trees and Brauer diagrams, inspired by links between binary trees and matchings described by Diaconis and Holmes (1998). This correspondence gives rise to a range of semigroup structures on…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…
We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…
The spin-4/3 fractional superstring is characterized by a world-sheet chiral algebra involving spin-4/3 currents. The discussion of the tree-level scattering amplitudes of this theory presented in hepth/9310131 is expanded to include…