English
Related papers

Related papers: Limit sets of unfolding paths in Outer space

200 papers

For any small positive real $\varepsilon$ and integer $t > \frac{1}{\varepsilon}$, we build a graph with a vertex deletion set of size $t$ to a tree, and twin-width greater than $2^{(1-\varepsilon) t}$. In particular, this shows that the…

Combinatorics · Mathematics 2022-04-19 Édouard Bonnet , Hugues Déprés

Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…

Probability · Mathematics 2017-11-06 Matthias Schulte , Christoph Thaele

In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…

Algebraic Topology · Mathematics 2019-03-07 Jorge Aguilar-Guzmán , Jesús González

Let $p(m)$ (respectively, $q(m)$) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with $k$ edges. We derive closed-form expressions…

Combinatorics · Mathematics 2021-09-14 Rain Jiang , Kai Jiang , Minghui Jiang

We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…

Probability · Mathematics 2018-09-17 Leon Ramzews , Benedikt Stufler

Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related…

Combinatorics · Mathematics 2026-03-19 Glencora Borradaile , Hung Le , Melissa Sherman-Bennett

In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…

Mathematical Physics · Physics 2013-09-19 Petarpa Boonserm , Matt Visser

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

Probability · Mathematics 2016-09-07 Sreela Gangopadhyay , Rahul Roy , Anish Sarkar

We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…

Number Theory · Mathematics 2023-01-10 Roberto Conti , Pierluigi Contucci

We show that on any compact Riemann surface with variable negative curvature there exists a measure which is invariant and ergodic under the geodesic flow and whose projection to the base manifold is 2-dimensional and singular with respect…

Dynamical Systems · Mathematics 2015-05-27 Risto Hovila , Esa Järvenpää , Maarit Järvenpää , François Ledrappier

This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration…

Combinatorics · Mathematics 2013-10-23 Clemens Huemer , Anna de Mier

Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…

Probability · Mathematics 2021-10-27 Itai Benjamini , Adam Timar

The geodesic structure is very closely related to the trace of the Laplace operator, involved in the calculation of the expectation value of the energy momentum tensor in Universes with non trivial topology. The purpose of this work is to…

General Relativity and Quantum Cosmology · Physics 2015-05-13 Daniel Muller

A separating path system for a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that for every two edges $e$ and $f$ in $G$, there is a path in $\mathcal{P}$ that contains $e$ but not $f$. We show that every $n$-vertex graph has…

Combinatorics · Mathematics 2024-05-30 Shoham Letzter

In this paper we study aspects of the ergodic theory of the geodesic flow on a non-compact negatively curved manifold. It is a well known fact that every continuous potential on a compact metric space has a maximizing measure.…

Dynamical Systems · Mathematics 2020-01-07 Felipe Riquelme , Anibal Velozo

For a fully irreducible automorphism \phi of the free group F_k we compute the asymptotics of the intersection number n \mapsto i(T,T'\phi^n) for trees T,T' in Outer space. We also obtain qualitative information about the geometry of the…

Group Theory · Mathematics 2014-02-26 Jason Behrstock , Mladen Bestvina , Matt Clay

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Combinatorics · Mathematics 2025-09-11 Tung Nguyen , Alex Scott , Paul Seymour

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

Thurston's boundary to the universal Teichm\"uller space $T(\mathbb{H})$ is the set of asymptotic rays to the embedding of $T(\mathbb{H})$ in the space of geodesic currents; the boundary is identified with the projective bounded measured…

Complex Variables · Mathematics 2018-04-11 Hrant Hakobyan , Dragomir Saric

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh