相关论文: Refined Horton-Strahler numbers I: a discrete bije…

Let $\mathcal{T}^{(p)}_n$ be the set of $p$-ary labeled trees on $\{1,2,\dots,n\}$. A maximal decreasing subtree of an $p$-ary labeled tree is defined by the maximal $p$-ary subtree from the root with all edges being decreasing. In this…

Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a…

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…

It is well known that the spectral radius $\rho(T)$ of a tree $T$ with at least $3$ vertices has the property that $\frac 14\rho(T)^2+1<\Delta(T)\le \rho(T)^2$, where $\Delta(T)$ is the maximum degree of $T$. Let $\mathbb{P}$ denote the set…

A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that…

Ordinals can help prove termination for dependently typed programs. Brouwer trees are a particular ordinal notation that make it very easy to assign sizes to higher order data structures. They extend natural numbers with a limit…

In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N)) time complexity for performing several types of queries and updates on general rooted trees, binary search trees and lists of size N. For rooted trees we introduce…

For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \subseteq {1,2,...,n}$ of leaves…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…

A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…

Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing in tree data structures. In this paper, we initiate the study…

Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…

We construct in this article an explicit geometric rough path over arbitrary $d$-dimensional paths with finite $1/\alpha$-variation for any $\alpha\in(0,1)$. The method may be coined as 'Fourier normal ordering', since it consists in a…

It has been previously shown by the authors that a directed graph on a linearly ordered set of edges (ordered graph) with adjacent unique source and sink (bipolar digraph) has a unique fully optimal spanning tree, that satisfies a simple…

Given a spanning tree $T$ of a planar graph $G$, the co-tree of $T$ is the spanning tree of the dual graph $G^*$ with edge set $(E(G)-E(T))^*$. Gr\"unbaum conjectured in 1970 that every planar 3-connected graph $G$ contains a spanning tree…