相关论文: Trees and the dynamics of polynomials

Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a…

Let $(X, \mathcal{F})$ be a foliated surface and $G$ a finite group of automorphisms of $X$ that preserves $\mathcal{F}$. We investigate invariant loci for $G$ and obtain upper bounds for its order that depends polynomially on the Chern…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…

In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a…

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

In this article, we define a locally finite graph $X$ as $\eta$-polynomially hyperbolic if there exists a Lipschitz map $\varphi : X \to Z$ to some hyperbolic space $Z$ satisfying the following condition: there exists $C \geq 0$ such that…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…

The dynamical degree of a dominant rational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$ is the quantity $\delta(f):=\lim(\text{deg} f^n)^{1/n}$. We study the variation of dynamical degrees in 1-parameter families of maps $f_T$. We make a…

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

Evolutionary relationships between species are represented by phylogenetic trees, but these relationships are subject to uncertainty due to the random nature of evolution. A geometry for the space of phylogenetic trees is necessary in order…

We compute the magnitude (an isometric invariant of metric spaces) of compact $\mathbb{R}$-trees and show that it equals $1 + L/2$, where $L \in [0, \infty]$ denotes the total length. Although length is the only geometric invariant captured…

A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree…

We investigate the interrelations between labeled trees and ultrametric spaces generated by these trees. The labeled trees, which generate complete ultrametrics, totally bounded ultrametrics, and discrete ones, are characterized up to…