Related papers: Word Measures On Wreath Products I

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…

Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…

We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…

The goal of this paper is to understand the set $\mathrm{End}(W)$ of endomorphisms of an irreducible spherical reflection group $W$. We do this in two ways: numerically, by deriving an explicit formula for $|\mathrm{End}(W)|$; and…

We study the isoperimetric profiles of certain families of finitely generated groups defined via marked Schreier graphs and permutation wreath products. The groups we study are among the "simplest" examples within a much larger class of…

The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…

We consider random walks on finitely or countably generated free semigroups, and identify their Poisson boundaries for classes of measures which fail to meet the classical entropy criteria. In particular, we introduce the notion of…

Let $F$ be a non-discrete non-Archimedean locally compact field such that the characteristic $\mathrm{ch}(F)\ne 2$ and let $\mathcal{O}_F$ be the ring of integers in $F$. The main results of this paper are Theorem 1.2 that classifies…

For a restricted wreath product $G\wr \mathbb{Z}^k$, where $G$ is a finite abelian group, we determine (almost in all cases) whether this product has the $R_\infty$ property (i.e., each its automorphism has infinite Reidemeister number).

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

In 1997 Clarke et al. studied a $q$-analogue of Euler's difference table for $n!$ using a key bijection $\Psi$ on symmetric groups. In this paper we extend their results to the wreath product of a cyclic group with the symmetric group. In…

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in…

This paper introduces the concept of the Fibonacci Word Index $\operatorname{FWI}$, a novel topological index derived from the Albertson index, applied to trees constructed from Fibonacci words. Building upon the classical Fibonacci…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…