Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We introduce some classes of increasing labeled and multilabeled trees, and we show that these trees provide combinatorial interpretations for certain Thron-type continued fractions with coefficients that are quasi-affine of period 2. Our…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
A one-to-one continuous function from a triangle to itself is defined that has both interesting number theoretic and analytic properties. This function is shown to be a natural generalization of the classical Minkowski ?(x) function. It is…
Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…
In this paper we demonstrate connections between three seemingly unrelated concepts. (1) The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, $ {\mathcal T}_{\infty}$: The $n$-th edge…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
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…
Scattering amplitudes of the spin-4/3 fractional superstring are shown to satisfy spurious state decoupling and cyclic symmetry (duality) at tree-level in the string perturbation expansion. This fractional superstring is characterized by…
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n).…
We study the growth of the values of binary quadratic forms $Q$ on a binary planar tree as it was described by Conway. We show that the corresponding Lyapunov exponents $\Lambda_Q(x)$ as a function of the path determined by $x\in \mathbb…
The Minkowski Question Mark function can be characterized as the unique homeomorphism of the real unit interval that conjugates the Farey map with the tent map. We construct an n-dimensional analogue of the Minkowski function as the only…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
In this note we list a number of open problems in the fields of number theory, combinatorics, and representation theory: algebraic functions with Fermat property; power product expansion of the generating function for the partition…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…
We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…