English
Related papers

Related papers: Projective Fra\"{\i}ss\'{e} limits of trees

200 papers

This dissertation is about rearrangement groups: a class of groups of homeomorphisms of fractal topological spaces. Introduced in 2019 by J. Belk and B. Forrest, this class generalizes the famous trio of Thompson groups $F$, $T$ and $V$ and…

Group Theory · Mathematics 2024-12-04 Matteo Tarocchi

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…

The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that generalises R\'emy's algorithm for binary trees. We describe the…

Probability · Mathematics 2020-02-25 Delphin Sénizergues

We investigate infinite distance limits in the complex structure moduli space of F-theory compactified on K3 to eight dimensions. While this is among the simplest possible arenas to test ideas about the Swampland Distance Conjecture, it is…

High Energy Physics - Theory · Physics 2022-06-29 Seung-Joo Lee , Wolfgang Lerche , Timo Weigand

The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…

Logic · Mathematics 2025-12-08 Peter J. Cameron , Siavash Lashkarighouchani

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

Combinatorics · Mathematics 2019-03-14 Felix Joos , Jaehoon Kim , Daniela Kühn , Deryk Osthus

We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…

Logic in Computer Science · Computer Science 2025-01-23 Amina Doumane , Samuel Humeau , Damien Pous

We prove that for any nondegenerate dendrite $D$ there exist topologically mixing maps $F : D \to D$ and $f : [0, 1] \to [0, 1]$, such that the natural extensions (aka shift homeomorphisms) $\sigma_F$ and $\sigma_f$ are conjugate, and…

Dynamical Systems · Mathematics 2021-10-25 J. Boroński , P. Minc , S. Štimac

A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…

Geometric Topology · Mathematics 2014-05-29 Suhyoung Choi

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…

Condensed Matter · Physics 2007-05-23 L. Donetti

It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However, although tree-width is obviously not monotone under any…

Combinatorics · Mathematics 2025-06-11 Benjamin Merlin Bumpus , James Fairbanks , Will J. Turner

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

Combinatorics · Mathematics 2025-08-01 Ugo Giocanti

This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as…

Probability · Mathematics 2020-01-10 François Baccelli , Mir-Omid Haji-Mirsadeghi , Ali Khezeli

We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…

Probability · Mathematics 2023-07-25 Nicolas Broutin , Jean-François Marckert

We exhibit two three-parameter families of locally conformal symplectic forms on the solvmanifold $M_{n,k}$ considered in [1], and show, using the Hodge-de Rham theory for the Lichnerowicz cohomology that that they are not $d_{\omega}$…

Symplectic Geometry · Mathematics 2007-05-23 Augustin Banyaga

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive…

Probability · Mathematics 2016-01-15 Cecilia Holmgren , Svante Janson

In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…

Dynamical Systems · Mathematics 2025-07-08 Mikhail Hlushchanka , Olga Lukina , Dean Wardell

We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the…

Probability · Mathematics 2024-03-05 Sayan Banerjee , Shankar Bhamidi , Xiangying Huang

We prove that the tree-width of graphs in a hereditary class defined by a finite set $F$ of forbidden induced subgraphs is bounded if and only if $F$ includes a complete graph, a complete bipartite graph, a tripod (a forest in which every…

Combinatorics · Mathematics 2021-01-06 Vadim Lozin , Igor Razgon
‹ Prev 1 3 4 5 6 7 10 Next ›