相关论文: On Ternary Trees and Fighting Fish

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…

We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…

A normal network is uniquely determined by the set of phylogenetic trees that it displays. Given a set $\mathcal{P}$ of rooted binary phylogenetic trees, this paper presents a polynomial-time algorithm that reconstructs the unique binary…

We study the problem of learning a node-labeled tree given independent traces from an appropriately defined deletion channel. This problem, tree trace reconstruction, generalizes string trace reconstruction, which corresponds to the tree…

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…

We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…

In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…

Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…

In this work we completely describe the dynamics of triangle tiling billiards. In the first part of this work, we propose a geometric approach of dynamics by introducing natural foliations associated to it. In the second part, we exploit…

Metabolites, small molecules that are involved in cellular reactions, provide a direct functional signature of cellular state. Untargeted metabolomics experiments usually relies on tandem mass spectrometry to identify the thousands of…

For nearly a century, researchers have tried to understand the swimming of aquatic animals in terms of a balance between the forward thrust from swimming movements and drag on the body. Prior approaches have failed to provide a separation…

In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…

A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams…

We consider a distributed detection system with communication constraints, where several nodes are arranged in an arbitrary tree topology, under the assumption of conditionally independent observations. We propose a cyclic design procedure…

An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and…

We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND attack tree formalism increases the expressivity of attack trees by introducing the sequential conjunctive…

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…