Related papers: Combinatorial properties of Thompson's group F
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…
Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…
This article proves a version of the Feit-Thompson theorem for simple groups of finite Morley rank: a connected groups of finite Morley rank with a finite Sylow 2-subgroup has a trivial Sylow 2-subgroups.
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
Recently, the diagrammatic description of soft-gluon exponentiation in scattering amplitudes has been generalized to the multiparton case. It was shown that the exponent of Wilson-line correlators is a sum of webs, where each web is formed…
We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…
This is the second in a series of papers developing a theory of total positivity for loop groups. In this paper, we study infinite products of Chevalley generators. We show that the combinatorics of infinite reduced words underlies the…
We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…
The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with…
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…
A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using,…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
The dead-end depth of an element g of a group with finite generating set A is the distance from g to the complement of the radius d(1,g) closed ball, in the word metric d associated to A. We exhibit a finitely presented group K with two…
We construct an action of the Thompson group F on a compact space built from pairs of infinite, binary rooted trees. The action arises as an F-equivariant compactification of the action of F by translations on one of its homogeneous spaces,…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
We provide a new characterization of amenability for countable groups, based on frame representations admitting almost invariant vectors. By relaxing the frame inequalities, thereby weakening amenability, we obtain a large class of…
Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…