Related papers: Limit sets of unfolding paths in Outer space
We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path--an xy-monotone path in an appropriately rotated coordinate system. We show…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in a Hilbert space. Our arguments are based on nonexpansive mapping theory.
We compute the asymptotic growth rate of the number N(C, R) of closed geodesics of length less than R in a connected component C of a stratum of quadratic differentials. We prove that for any 0 < \theta < 1, the number of closed geodesics…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
Two graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ admit a geometric simultaneous embedding if there exists a set of points P and a bijection M: P -> V that induce planar straight-line embeddings both for $G_1$ and for $G_2$. While it is known that…
We study the problem of simultaneous geometric embedding of two paths without self-intersections on an integer grid. We show that minimizing the length of the longest edge of such an embedding is NP-hard. We also show that we can minimize…
For a geodesic flow on a negatively curved Riemannian manifold $M$ and some subset $A\subset T^1M$, we study the limit $A$-exceptional set, that is the set of points whose $\omega$-limit do not intersect $A$. We show that if the topological…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
Given a polarized projective variety (X,L) over any non-Archimedean field, assuming continuity of envelopes, we show that the space of finite-energy metrics on L is a geodesic metric space, where geodesics are given as maximal psh segments.…
Given an extendible spacetime one may ask how much, if any, uniqueness can in general be expected of the extension. Locally, this question was considered and comprehensively answered in a recent paper of Sbierski, where he obtains local…
Let $T$ be a positive closed current of unit mass on the complex projective space $\mathbb P^n$. For certain values $\alpha<1$, we prove geometric properties of the set of points in $\mathbb P^n$ where the Lelong number of $T$ exceeds…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G such that T and T* do not intersect. We show that it is not always possible to find T in G, such that the diameters of T and T*…
In 2021, motivated by graph limit theory Lov\'asz extended most of the theory of flows to a measure theoretic setting. Using this framework, the first author constructed $d$-regular treeings that are measurably bipartite, and have no…
We study the outer automorphism group of a right-angled Artin group A_G in the case where the defining graph G is connected and triangle-free. We give an algebraic description of Out(A_G) in terms of maximal join subgraphs in G and prove…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…