English
Related papers

Related papers: Indecomposable $F_N$-trees and minimal laminations

200 papers

We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…

Mathematical Physics · Physics 2007-06-20 Arthur Jaffe , David Moser

We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…

Combinatorics · Mathematics 2026-05-05 Sepehr Hajebi , Sophie Spirkl

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

Classical Analysis and ODEs · Mathematics 2011-10-07 Laura Poggiolini , Marco Spadini

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

Combinatorics · Mathematics 2024-05-14 Sandra Albrechtsen , Raphael W. Jacobs , Paul Knappe , Max Pitz

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 consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume that the leaves have access to independent and identically…

Multiagent Systems · Computer Science 2011-04-18 Yashodhan Kanoria , Andrea Montanari

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

Dynamical Systems · Mathematics 2022-01-07 A. Baraviera , R. Leplaideur

In this paper, we study the independence of shifts defined on $\mathbb{N}^d$ ($\mathbb{N}^d$ shift) and trees (tree-shift). Firstly, for the completeness of the article, we provide a proof that an $\mathbb{N}^d$ shift has positive…

Dynamical Systems · Mathematics 2024-12-03 Jung-Chao Ban , Guan-Yu Lai

We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…

Probability · Mathematics 2024-01-26 Gourab Ray , Arnab Sen

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

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Commutative Algebra · Mathematics 2021-08-05 Francesca Gandini

Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…

Dynamical Systems · Mathematics 2025-03-07 Alexandre I. Danilenko , Artem Dudko

We show that if a group G acts isometrically on a locally finite leafless R-tree inducing a two-transitive action on its ends, then this tree is determined by the action of G on the boundary. As a corollary we obtain that locally finite…

Metric Geometry · Mathematics 2014-12-02 Koen Struyve

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

Combinatorics · Mathematics 2025-12-19 Alexey Pokrovskiy , Leo Versteegen , Ella Williams

Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two…

Group Theory · Mathematics 2012-05-04 Matt Clay , Alexandra Pettet

We obtain upper bounds for the isoperimetric quotients of extrinsic balls of submanifolds in ambient spaces which have a lower bound on their radial sectional curvatures. The submanifolds are themselves only assumed to have lower bounds on…

Differential Geometry · Mathematics 2007-09-04 Steen Markvorsen , Vicente Palmer

We consider the action of an irreducible outer automorphism $\phi$ on the closure of Culler--Vogtmann Outer space. This action has north-south dynamics and so, under iteration, points converge exponentially to $[T^\phi_+]$. For each $N \geq…

Group Theory · Mathematics 2016-08-05 Mark C. Bell

We study the Hausdorff and the box dimensions of closed invariant subsets of the space of pointed trees, equipped with a pseudogroup action. This pseudogroup dynamical system can be regarded as a generalization of a shift space. We show…

Dynamical Systems · Mathematics 2021-12-22 Olga Lukina

We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…

Logic in Computer Science · Computer Science 2022-01-27 Jan Dreier , Jakub Gajarský , Sandra Kiefer , Michał Pilipczuk , Szymon Toruńczyk