相关论文: Thompson's Group F

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…

We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered semigroups include free groups. On the other hand, the notion of stem entropy is introduced.…

Let F be the Thompson's group. We study the structure of F-limit groups. Consider a sequence of groups marked by three elements, each isomorphic to F. Assume that the this sequence is convergent in the space of marked groups. We prove that…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…

The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…

Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and are denoted FMSF (free minimal spanning forest) and WMSF…

We prove that a polynomial fraction of the set of $k$-component forests in the $m \times n$ grid graph have equal numbers of vertices in each component, for any constant $k$. This resolves a conjecture of Charikar, Liu, Liu, and Vuong, and…

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…

We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a…

A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…

This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…

Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set. Namely, we…

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

We show that all three golden ratio Thompson's groups $F_\tau$, $T_\tau$ and $V_\tau$ embed in the asynchronous rational group. We prove properties of the Cayley graph of the monoid $M = \langle L, R : LR^2 = RL^2 \rangle$, whose…

We prove that the Poisson boundary of a simple random walk on the Schreier graph of action of $F$ on $\mathbb{D}$, where $\mathbb{D}$ is the set of dyadic numbers in $[0, 1]$, is non-trivial. This gives a new proof of the result of…

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…