Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
Braided differential operators $\del^i$ are obtained by differentiating the addition law on the braided covector spaces introduced previously (such as the braided addition law on the quantum plane). These are affiliated to a Yang-Baxter…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
The Minkowski's Question-Mark function is a singular homeomorphism of the unit interval that maps the set of quadratic surds into the rationals. This function has deserved the attention of several authors since the beginning of the…
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new…
We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
It is shown here that the percolation cluster that emerges from the percolation process on infinite perfect binary trees, is genuinely an encoding scheme for an infinite set of symbols. The average codeword length and the entropy of such an…
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions of this logic. We show that adding either additional binary…
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree…
We study Stokes phenomena of the k \times k isomonodromy systems with an arbitrary Poincar\'e index r, especially which correspond to the fractional-superstring (or parafermionic-string) multi-critical points (\hat p,\hat q)=(1,r-1) in the…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
In this paper we study various fractal geometric aspects of the Minkowski question mark function $Q.$ We show that the unit interval can be written as the union of the three sets $\Lambda_{0}:=\{x:Q'(x)=0\}$,…
We propose a new succinct representation of labeled trees which represents a tree T using |T|H_k(T) number of bits (plus some smaller order terms), where |T|H_k(T) denotes the k-th order (tree label) entropy, as defined by Ferragina at al.…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
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 obtain a generating function for the degree sequences and colors of rooted multipartite labeled series-reduced trees. As an application of this result, we determine the number of symbolic ultrametrics (introduced by B\"ocker and Dress)…
Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.…
Chinese word segmentation is a fundamental task for Chinese language processing. The granularity mismatch problem is the main cause of the errors. This paper showed that the binary tree representation can store outputs with different…
In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one…
We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry and find that for certain classes of gates, applied identically at each node, a binary tree circuit encodes a single logical qubit with…