Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
The aim of this article is to present a growth-fragmentation process naturally embedded in a Brownian excursion from boundary to apex in a cone of angle $2\pi/3$. This growth-fragmentation process corresponds, via the so-called…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
We consider two different physical systems for which the basis of the Hilbert space can be parametrized by Young diagrams: free complex fermions and the phase model of strongly correlated bosons. Both systems have natural, well-known…
I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
We analyse the dimension spectrum of continued fractions expansions with coefficients restricted to infinite subsets of $ \mathbb{N}$. We prove that the set of powers $P_q=\{q^n\colon n\in \mathbb{N}\}$ has full dimension spectrum for each…
There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…
We encode a certain class of stochastic fragmentation processes, namely self-similar fragmentation processes with a negative index of self-similarity, into a metric family tree which belongs to the family of Continuum Random Trees of…
A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…
We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and find many theorems of classical number theory arise as particular cases of extremely general combinatorial structure…
We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of…
Based on the author's previous work on the Jacobi identity for twisted relative vertex operator algebras and modules and on the generating function identities for affine Lie algebras, we interpret the second difference sequence of the…
A Markov tree is a random vector indexed by the nodes of a tree whose distribution is determined by the distributions of pairs of neighbouring variables and a list of conditional independence relations. Upon an assumption on the tails of…
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are distributionally invariant. This operation is new even in the special case of the Brownian CRT, which we explore in more detail. The…
We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Fa\`a di Bruno formula,…
An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…
For a commutative quantale $\mathcal{V}$, the category $\mathcal{V}-cat$ can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor $T$ (formalised as an endofunctor on sets) can be…
The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…