Related papers: Combinatorial properties of Thompson's group F

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

Let $\Gamma$ be a group and $(\Gamma_n)_{n=1} ^{\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\Gamma/\Gamma_n$ , under some…

We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…

The combinatorics of reduced words and commutation classes plays an important role in geometric representation theory. A string polytope is a lattice polytope associated to each reduced word of the longest element $w_0$ in the symmetric…

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…

We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…

The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…

This paper looks at the class of groups admitting normal forms for which the right multiplication by a group element is computed in linear time on a multi-tape Turing machine. We show that the groups $\mathbb{Z}_2 \wr \mathbb{Z}^2$,…

We characterize which permutational wreath products W^(X)\rtimes G are finitely presented. This occurs if and only if G and W are finitely presented, G acts on X with finitely generated stabilizers, and with finitely many orbits on the…

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

We present a simple structure based model of how words are formed from morphemes. The model explains two major empirical facts: the typical distribution of word lengths and the appearance of Zipf like rank frequency curves. In contrast to…

A remarkable result at the intersection of number theory and group theory states that the order of a finite group $G$ (denoted $|G|$) is divisible by the dimension $d_R$ of any irreducible complex representation of $G$. We show that the…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any reductive group scheme $\mathbb{G}$ over $\mathbb{Z}$ such…

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we…

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

We show that the free group of rank 2 is a limit of 2-markings of Thompson's group F in the space of all 2-marked groups. More specifically, we find a sequence of generating pairs for F so that as one goes out the sequence, the length of…

A propositional logic sentence in conjunctive normal form that has clauses of length two (a 2-CNF) can be associated with a multigraph in which the vertices correspond to the variables and edges to clauses. We first show that every such…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…