Related papers: Involutions on Tip-Augmented Plane Trees for Leaf …
This paper considers Darboux transformations of a bispectral operator which preserve its bispectrality. A sufficient condition for this to occur is given, and applied to the case of generalized Airy operators of arbitrary order $r>1$. As a…
One approach to estimating a species tree from a collection of gene trees is to first estimate probabilities of clades from the gene trees, and then to construct the species tree from the estimated clade probabilities. While a greedy…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
This article deals with the study of the birational transformations of the projective complex plane which leave invariant an irreducible algebraic curve. We try to describe the state of art and provide some new results on this subject.
In the current note we extend results by Marmi, Moussa and Yoccoz about cohomological equations for interval exchange transformations to irreducible linear involutions.
We study the correspondence between equivalence classes of pairs consisting of real semisimple Lie algebras and their Cartan subalgebras and involutions of the corresponding root system. This can be graphically described by introducing…
Tree-like tableaux are certain fillings of Ferrers diagrams originally introduced by Aval et al., which are in simple bijections with permutation tableaux coming from Postnikov's study of totally nonnegative Grassmanian and alternative…
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.
We introduce two models for multi-type random trees motivated by studies of trait dependence in the evolution of species. Our discrete time model, the multi-type ERM tree, is a generalization of Markov propagation models on a random tree…
This paper presents a detailed comparison of a recently proposed algorithm for optimizing decision trees, tree alternating optimization (TAO), with other popular, established algorithms. We compare their performance on a number of…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
In this short note, we classify the degree-inverting involution on the full square and triangular matrices.
Tree alignment graphs (TAGs) provide an intuitive data structure for storing phylogenetic trees that exhibits the relationships of the individual input trees and can potentially account for nested taxonomic relationships. This paper…
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…
This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…
In a recent paper on 'Estimating Species Trees from Unrooted Gene Trees' Liu and Yu observe that the distance matrix on the underlying taxon set, which is built up from expected internode distances on gene trees under the multispecies…
Dorff et al. \cite{DN} formulated a question concerning the convolution of two right half-plane mappings, where the normalization of the functions was considered incorrectly. In this paper, we have reformulated the open problem in correct…
A Supertree synthesizes the topologies of a set of phylogenetic trees carrying overlapping taxa set. In process, conflicts in the tree topologies are aimed to be resolved with the consensus clades. Such a problem is proved to be NP-hard.…
This paper uses a construction of M. Keane to show that there exists a topologically mixing interval exchange transformation.