相关论文: A finitely presented group with unbounded dead-end…

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…

Let $G$ be a group generated by a finite set $A$. An element $g\in G$ is a strict dead end of depth $k$ (with respect to $A$) if $|g|>|ga_1|>|ga_1a_2|>...>|ga_1a_2... a_k|$ for any $a_1,a_2, ..., a_k\in A^{\pm1}$ such that the word…

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

We show that the discrete Heisenberg group has unbounded dead-end depth with respect to every finite generating set. We also show that, in contrast, it has bounded retreat depth.

It is known, that the existence of dead ends (of arbitrary depth) in the Cayley graph of a group depends on the chosen set of generators. Nevertheless there exist many groups, which do not have dead ends of arbitrary depth with respect to…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.

Full residual finiteness growth of a finitely generated group $G$ measures how efficiently word metric $n$-balls of $G$ inject into finite quotients of $G$. We initiate a study of this growth over the class of nilpotent groups. When the…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

For any finite group $A$ and any finitely generated group $B$, we prove that the corresponding lamplighter group $A\wr B$ admits a standard generating set with unbounded depth, and that if $B$ is abelian then the above is true for every…

Let $G$ be a connected real algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G=G_0>G_1>...>G_t=1$ where each $G_i$ is a maximal connected real subgroup of $G_{i-1}$. The maximal (respectively, minimal) length of such an…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…

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…

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…

The representation dimension of a finite group $G$ is the minimal dimension of a faithful complex linear representation of $G$. We prove that the representation dimension of any finite group $G$ is at most $\sqrt{|G|}$ except if $G$ is a…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…