Related papers: Homotopy Hubbard Trees for post-singularly finite …

A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…

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…

Let M be a monoidal category endowed with a distinguished class of weak equivalences and with appropriately compatible classifying bundles for monoids and comonoids. We define and study homotopy-invariant notions of normality for maps of…

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…

We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…

Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…

We give a combinatorial classification of postsingularly finite exponential maps in terms of external addresses starting with the entry 0. This is an extension of the classification results for critically preperiodic polynomials \cite{BFH}…

The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…

This work addresses the intrinsic relationship between trees and networks (i.e. graphs). A complete (invertible) mapping is presented which allows trees to be mapped into weighted graphs and then backmapped into the original tree without…

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…

We prove John Hubbard's conjecture on the topological complexity of the hyperbolic horseshoe locus of the complex H\'enon map. Indeed, we show that there exist several non-trivial loops in the locus which generate infinitely many mutually…

We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…

It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition…

We study spaces with a cuspidal (or horn-like) singularity embedded in a smooth Riemannian manifold and analyze the geodesics in these spaces which start at the singularity. This provides a basis for understanding the intrinsic geometry of…

We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

In a series of three papers we develop an end space theory for digraphs. Here in the third paper we introduce a concept of depth-first search trees in infinite digraphs, which we call normal spanning arborescences. We show that normal…

We prove that the tree almost automorphism groups admit exactly three commensurability classes of closed commensurated subgroups. Our proof utilizes an independently interesting characterization of subgroups of the tree almost automorphism…