English
Related papers

Related papers: Uniformly branching trees

200 papers

Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…

Functional Analysis · Mathematics 2017-05-08 Anders Björn , Jana Björn , James T. Gill , Nageswari Shanmugalingam

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

Populations and Evolution · Quantitative Biology 2007-05-23 Frederick A. Matsen , Steven N. Evans

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

Probability · Mathematics 2021-04-29 Wolfgang Löhr , Anita Winter

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

Combinatorics · Mathematics 2013-05-21 Xueliang Li , Yiyang Li , Yongtang Shi

Let $T$ be an unrooted tree. The \emph{chromatic symmetric function} $X_T$, introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of $T$. The \emph{subtree polynomial} $S_T$, first considered…

Combinatorics · Mathematics 2011-10-05 Jeremy L. Martin , Matthew Morin , Jennifer D. Wagner

A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…

Algebraic Topology · Mathematics 2020-04-29 Matthew Kahle , Andrew Newman

Let $G = (V,E)$ denote a simple graph with the vertex set $V$ and the edge set $E$. The profile of a vertex set $V'\subseteq V$ denotes the multiset of pairwise distances between the vertices of $V'$. Two disjoint subsets of $V$ are…

Combinatorics · Mathematics 2013-11-08 Radoslav Fulek , Slobodan Mitrović

We consider quasiconformal deformations of $\mathbb{C}\setminus\mathbb{Z}$. We give some criteria for infinitely often punctured planes to be quasiconformally equivalent to $\mathbb{C}\setminus\mathbb{Z}$. In particular, we characterize the…

Differential Geometry · Mathematics 2014-12-30 Hiroki Fujino

We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…

Combinatorics · Mathematics 2023-10-16 Erkko Lehtonen , Tamás Waldhauser

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…

Combinatorics · Mathematics 2021-05-05 Nikos Apostolakis

We prove that a self-homeomorphism of the Grushin plane is quasisymmetric if and only if it is metrically quasiconformal and if and only if it is geometrically quasiconformal. As the main step in our argument, we show that a quasisymmetric…

Metric Geometry · Mathematics 2021-12-20 Chris Gartland , Derek Jung , Matthew Romney

A semi-lattice is said to be tree-like when any two of its elements are either orthogonal or comparable. Given an inverse semigroup S whose idempotent semi-lattice is tree-like, and such that all tight filters are ultra-filters, we present…

Operator Algebras · Mathematics 2014-10-01 Giuliano Boava , Ruy Exel

A gluing of two rooted trees is an identification of their leaves and un-subdivision of the resulting 2-valent vertices. A gluing of two rooted trees is subdivergence free if it has no 2-edge cuts with both roots on the same side of the…

Combinatorics · Mathematics 2025-01-13 Xinle Dai , Jordan Long , Karen Yeats

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…

Logic · Mathematics 2007-05-23 Alex Hellsten , Tapani Hyttinen , Saharon Shelah

The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…

Combinatorics · Mathematics 2011-10-24 Aaron Kleinman , Matan Harel , Lior Pachter

For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…

We prove that if $f:\mathbb{B}^n \to \mathbb{B}^n$, for $n\geq 2$, is a homeomorphism with bounded skew over all equilateral hyperbolic triangles, then $f$ is in fact quasiconformal. Conversely, we show that if $f:\mathbb{B}^n \to…

Complex Variables · Mathematics 2019-09-26 C. Ackermann , A. Fletcher

In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree…

Combinatorics · Mathematics 2026-05-20 Tonny K B , Shikhi M

A tree T_uni is m-universal for the class of trees if for every tree T of size m, T can be obtained from T_uni by successive contractions of edges. We prove that a m-universal tree for the class of trees has at least mln(m) + (gamma-1)m +…

Discrete Mathematics · Computer Science 2009-11-17 Olivier Bodini
‹ Prev 1 3 4 5 6 7 10 Next ›