Related papers: Thompson's Group F

We answer the question by Matt Brin on the structure of diagram groups over semigroup presentation ${\mathcal P}=\langle a,b,c\mid a=bc,b=ca,c=ab\rangle$. In the talk on Oberwolfach workshop, Brin conjectured that the diagram group over…

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…

We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…

Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…

In this paper, we provide a comprehensive classification of Stein's groups, which generalize the well-known Higman-Thompson groups. Stein's groups are defined as groups of piecewise linear bijections of an interval with finitely many…

In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

In order to use the Gaussian representation for propagators in Feynman amplitudes, a representation which is useful to relate string theory and field theory, one has to prove first that each $\alpha$- parameter (where $\alpha$ is the…

The Gallai graph $\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\Gamma(G)$ are adjacent in $\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle…

When 1 -> H -> G -> Q -> 1 is a short exact sequence of three infinite, word-hyperbolic groups, Mahan Mitra (Mj) has shown that the inclusion map from H to G extends continuously to a map between the Gromov boundaries of H and G. This…

We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired…

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…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Phylogenetic networks generalise phylogenetic trees and allow for the accurate representation of the evolutionary history of a set of present-day species whose past includes reticulate events such as hybridisation and lateral gene transfer.…

We show that the links associated with positive elements of the Thompson group $F$ coincide with the closures of bipartite arborescent tangles.

Thompson's group F is the group of all increasing dyadic piecewise linear homeomorphisms of the closed unit interval. We compute Sigma^m(F) and Sigma^m(F;Z), the homotopical and homological Bieri-Neumann-Strebel-Renz invariants of F, and we…

Given a bounded valence, bushy tree T, we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T'. This theorem has many applications: quasi-isometric rigidity…

We introduce a refinement of bounded cohomology and prove that the suitable comparison homomorphisms vanish for an amenable group. We investigate in this context Thompson's group F and provide further evidence towards its amenability. We…

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…