Related papers: On commutator length in free groups
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…
A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…
We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.
In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x1,x2,...,xn over the field F. We obtain the following result Given a noncommutative…
Each element of the commutator subgroup of a group can be represented as a product of commutators. The minimal number of factors in such a product is called the commutator length of the element. The commutator length of a group is defined…
We develop a new criterion to tell if a group $G$ has the maximal gap of $1/2$ in stable commutator length (scl). For amalgamated free products $G = A \star_C B$ we show that every element $g$ in the commutator subgroup of $G$ which does…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
We establish an operator-theoretic uncertainty principle over arbitrary compact groups, generalizing several previous results. As a consequence, we show that if f is in L^2(G), then the product of the measures of the supports of f and its…
Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…
We are looking for the smallest integer k>1 providing the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g such that for any k elements a_1,a_2,...,a_k the subgroup…
We study the lattice of finite-index extensions of a given finitely generated subgroup $H$ of a free group $F$. This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of $H$.…
An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…
Let $f:=(f_n)_{n\in \mathbb{Z}_+}$ and $g:=(g_n)_{n\in \mathbb{Z}_+}$ be two martingales related to the probability space $(\Omega,\mathcal F,\mathbb P)$ equipped with the filtration $(\mathcal F_n)_{n\in \mathbb{Z}_+}.$ Assume that $f$ is…
A position $p$ in a word $w$ is critical if the minimal local period at $p$ is equal to the global period of $w$. According to the Critical Factorisation Theorem all words of length at least two have a critical point. We study the number…
We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…
Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…