Related papers: The Pythagorean Tree: A New Species
A tree-based network $N$ on $X$ is called universal if every phylogenetic tree on $X$ is a base tree for $N$. Recently, binary universal tree-based networks have attracted great attention in the literature and their existence has been…
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…
Let $\phi$ be a polynomial over $K$ (a field of characteristic 0) such that the Hessian of $\phi$ is a nonzero constant. Let $\bar\phi$ be the formal Legendre Transform of $\phi$. Then $\bar\phi$ is well-defined as a formal power series…
Let $\Omega_n$ be the family of binary trees on $n$ vertices obtained by identifying the root of an rgood binary tree with a vertex of maximum eccentricity of a binary caterpillar. In the paper titled "On different middle parts of a tree…
Say that $(x, y, z)$ is a positive primitive integral Pythagorean triple if $x, y, z$ are positive integers without common factors satisfying $x^2 + y^2 = z^2$. An old theorem of Berggren gives three integral invertible linear…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
Alternating sign triangles have been introduced by Ayyer, Behrend and Fischer in 2016 and it was proven that there is the same number of alternating sign triangles with $n$ rows as there is of $n\times n$ alternating sign matrices. Later on…
We introduce the zip tree, a form of randomized binary search tree that integrates previous ideas into one practical, performant, and pleasant-to-implement package. A zip tree is a binary search tree in which each node has a numeric rank…
The (tree) amplituhedron $\mathcal A_{n,k,m}(Z)$ is a certain subset of the Grassmannian introduced by Arkani-Hamed and Trnka in 2013 in order to study scattering amplitudes in $N=4$ supersymmetric Yang-Mills theory. Confirming a conjecture…
Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…
Let $\Phi_n(x)$ denote the $n$th cyclotomic polynomial. In 1968 Sister Marion Beiter conjectured that $a_n(k)$, the coefficient of $x^k$ in $\Phi_n(x)$, satisfies $|a_n(k)|\le (p+1)/2$ in case $n=pqr$ with $p<q<r$ primes (in this case…
A ternary complex tree related to the golden ratio is used to show how the theory of complex trees works. We use the topological set of this tree to obtain a parametric family of trees in one complex variable. Even though some real ferns…
The simultaneous invariants of 2, 3, 4 and 5 ternary quadratic forms under the group $\SL(3, {\Bbb C})$ were given by several authors (P. Gordan, C. Ciamberlini, H.W. Turnbull, J.A Todd), utilizing the symbolic method. Using the Jordan…
We study the average number of distinct fringe subtrees in random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every $n \geq 2$ a probability…
The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary relations have not…
The ongoing explosion of genome sequence data is transforming how we reconstruct and understand the histories of biological systems. Across biological scales, from individual cells to populations and species, trees-based models provide a…
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
In 2005 Janson, extending earlier work of Mahmoud, Smythe, and Szyma\'nski, established the joint asymptotic normality of the outdegrees of a random plane recursive tree. In particular, he gave an explicit description of the limiting…
Conway and Ryba considered a table of bi-infinite Fibonacci sequences and discovered new interesting patterns. We extend their considerations to tables that are defined by the recurrence $X_{n+1}=dX_n+X_{n-1}$ for natural numbers $d$. In…