English
Related papers

Related papers: Growth of intersection numbers for free group auto…

200 papers

We work with attracting subshifts generated by substitutions which are also irreducible parageometric automorphisms of free groups. For such a dynamical system, we construct a tree substitution to approximate the repelling real tree of the…

Dynamical Systems · Mathematics 2017-11-13 Thierry Coulbois , Milton Minervino

Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved…

Group Theory · Mathematics 2013-10-01 Martin Kassabov , Francesco Matucci

Let $\phi$ be a function that maps any non-empty subset $A$ of $\mathbb{R}^2$ to a non-empty subset $\phi(A)$ of $\mathbb{R}^2$. A $\phi$-cover of a set $T=\{T_1, T_2, \dots, T_m\}$ of pairwise non-crossing trees in the plane is a set of…

Computational Geometry · Computer Science 2013-11-20 Luis Barba , Alexis Beingessner , Prosenjit Bose , Michiel H. M. Smid

This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…

Group Theory · Mathematics 2014-02-26 Thierry Coulbois , Arnaud Hilion , Martin Lustig

Let $R$ be a commutative, indecomposable ring with identity and $(P,\le)$ a partially ordered set. Let $FI(P)$ denote the finitary incidence algebra of $(P,\le)$ over $R$. We will show that, in most cases, local automorphisms of $FI(P)$ are…

Rings and Algebras · Mathematics 2017-04-28 Jordan Courtemanche , Manfred Dugas , Daniel Herden

The space of phylogenetic trees arises naturally in tropical geometry as the tropical Grassmannian. Tropical geometry therefore suggests a natural notion of a tropical path between two trees, given by a tropical line segment in the tropical…

Combinatorics · Mathematics 2023-12-06 Shelby Cox

Given a graph $G$, we study the number of independent sets in $G$, denoted $i(G)$. This parameter is known as both the Merrifield-Simmons index of a graph as well as the Fibonacci number of a graph. In this paper, we give general bounds for…

Combinatorics · Mathematics 2023-11-28 Michael Han , Sycamore Herlihy , Kirsti Kuenzel , Daniel Martin , Rachel Schmidt

A palindrome in a free group F_n is a word on some fixed free basis of F_n that reads the same backwards as forwards. The palindromic automorphism group \Pi A_n of the free group F_n consists of automorphisms that take each member of some…

Geometric Topology · Mathematics 2016-01-27 Neil J. Fullarton

We show that the intersection of three subgroups in a free group is related to the computation of the third homotopy group $\pi_3$. This generalizes a result of Gutierrez-Ratcliffe who relate the intersection of two subgroups with the…

Group Theory · Mathematics 2010-09-01 Hans-Joachim Baues , Roman Mikhailov

We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erd\H{o}s, F\"{u}redi, Loebl and S\'{o}s. Given a fixed tree $T$ on $n$ vertices and an edge-colouring of the complete graph $K_n$, for…

Combinatorics · Mathematics 2024-10-23 Lawrence Hollom , Lyuben Lichev , Adva Mond , Julien Portier

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

Group Theory · Mathematics 2022-11-10 Naomi Andrew , Armando Martino

As a variant of the much studied Tur\'an number, $ex(n,F)$, the largest number of edges that an $n$-vertex $F$-free graph may contain, we introduce the connected Tur\'an number $ex_c(n,F)$, the largest number of edges that an $n$-vertex…

Combinatorics · Mathematics 2022-08-15 Yair Caro , Balázs Patkós , Zsolt Tuza

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree $T$, and study the existence of the free energy density $\phi$, the limit of the log-partition function divided by…

Probability · Mathematics 2013-12-17 Amir Dembo , Andrea Montanari , Nike Sun

We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free…

Geometric Topology · Mathematics 2014-08-26 Ursula Hamenstaedt

We derive some explicit expressions for correlators on Grassmannian G_r(C^n) as well as on the moduli space of holomorphic maps, of a fixed degree d, from sphere into the Grassmannian. Correlators obtained on the Grassmannain are a first…

High Energy Physics - Theory · Physics 2007-05-23 Noureddine Chair

For every atoroidal iwip automorphism $\phi$ of $F_N$ (i.e. the analogue of a pseudo-Anosov mapping class) it is shown that the algebraic lamination dual to the forward limit tree $T_+(\phi)$ is obtained as "diagonal closure" of the support…

Group Theory · Mathematics 2013-11-12 Ilya Kapovich , Martin Lustig

For any finitely generated group $G$, two complexity functions $\alpha_G$ and $\beta_G$ are defined to measure the maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $G$ and the norm of its…

Group Theory · Mathematics 2015-02-06 Manuel Ladra , Pedro V. Silva , Enric Ventura

Towards attaining a better working understanding of fixed points of maps of tree-like continua, Oversteegen and Rogers constructed a tree-like continuum with a fixed-point-free self-map, described explicitly in terms of inverse limits.…

General Topology · Mathematics 2018-09-19 Rodrigo Hernández-Gutiérrez , L. C. Hoehn

We prove that if F is a finitely generated free group and f:F -> F is an automorphism with polynomial growth of degree d, then there exists a characteristic subgroup S < F of finite index such that the induced automorphism of the…

Group Theory · Mathematics 2007-05-23 Adam Piggott

Let $\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\mathcal F \subset \mathcal T_n$ is $t$-intersecting if for all $A, B \in \mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we…

Combinatorics · Mathematics 2025-07-25 Elizaveta Iarovikova , Andrey Kupavskii
‹ Prev 1 3 4 5 6 7 10 Next ›