Related papers: Limit sets of unfolding paths in Outer space

Two of the natural topologies for infinite graphs with edge-ends are Etop and Itop. In this paper, we study and characterize them. We show that Itop can be constructed by inverse limits of inverse systems of graphs with finitely many…

We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…

It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi,…

We study ergodic properties of compositions of holomorphic endomorphisms of the complex projective space chosen independently at random according to some probability distribution. Along the way, we construct positive closed currents which…

A real projective orbifold has a radial end if a neighborhood of the end is foliated by projective geodesics that develop into geodesics ending at a common point. It has a totally geodesic end if the end can be completed to have the totally…

We extend the techniques of [CH] to build an inductive procedure for studying actions in the boundary of the Culler-Vogtmann Outer Space, the main novelty being an adaptation of he classical Rauzy-Veech induction for studying actions of…

We show that any two non-conjugate points on a forward or backward complete connected Finsler manifold can be joined by infinitely many geodesics which are not covered by finitely many closed ones, provided that the Betti numbers of the…

A tree t-spanner of an unweighted graph G is a spanning tree T such that for every two vertices their distance in T is at most t times their distance in G. Given an unweighted graph G and a positive integer t as input, the tree t-spanner…

Let $H$ be an infinite dimensional Hilbert space. We show that there exist three orthogonal projections $X_1, X_2, X_3$ onto closed subspaces of $H$ such that for every $0\ne z_0\in H$ there exist $k_1, k_2,\dots \in \{1,2,3\}$ so that the…

An outerstring graph is the intersection graph of curves lying inside a disk with one endpoint on the boundary of the disk. We show that an outerstring graph with $n$ vertices has treewidth $O(\alpha\log n)$, where $\alpha$ denotes the…

We prove an asymptotic result on the maximum number of k-vertex subtrees in binary trees of given order. This problem turns out to be equivalent to determine the maximum number of k+2-cycles in n-vertex outerplanar graphs, thus we settle…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…

We introduce boundary special generic maps, a class of submersions from manifolds with boundary to Euclidean spaces whose restriction to the boundary has only boundary definite fold points as its singular points. We derive the…

Let $T$ be a tree rooted at $r$. Two vertices of $T$ are related if one is a descendant of the other; otherwise, they are unrelated. Two subsets $A$ and $B$ of $V(T)$ are unrelated if, for any $a\in A$ and $b\in B$, $a$ and $b$ are…

We construct forests that span $\mathbb{Z}^d$, $d\geq2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as short as possible. For $d\geq3$, two independent copies of…

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

We consider straight line flows on a translation surface that are minimal but not uniquely ergodic. We give bounds for the number of generic invariant probability measures.

We provide two constructions for $t$ edge-disjoint maximal outerplanar graphs on every number of $n \geq 4t$ vertices. The bound on the minimum number of vertices is tight. These constructions yield the existence of optimal…