Related papers: Dependence over subgroups of free groups

It is well-known that the existence of more than two ends in the sense of J.R. Stallings for a finitely generated discrete group $G$ can be detected on the cohomology group $\mathrm{H}^1(G,R[G])$, where $R$ is either a finite field, the…

We develop practical tools for analyzing the configuration set $F(G,k)$ of $k\geq 2$ distinct elements in a group $G$. We apply our results to design homogeneous linear systems in $\mathbb{F}_q$ that admit nontrivial solutions. Furthermore,…

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

Let $F$ be a field with at least three elements and $G$ a locally finite group. This paper aims to show that if either $F$ is algebraically closed or the characteristic of $F$ is positive, then an element in the group algebra $FG$ is a…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

Let $H\leq K$ be subgroups of a group G. We say that H is strongly closed in K with respect to G if whenever $a^g \in K$ where $a \in H, g \in G,$ then $a^g \in H.$ In this paper, we investigate the structure of a group G under the…

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…

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all…

It is well known [Lov\'asz, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\hom(F, G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$ ranges over all graphs. Thus, in principle, we can answer…

We consider certain positive definite functions on a finitely generated free group G that are defined with respect to a given basis in terms of word length and the number of negative-to-positive generator exponent switches. Some of these…

We give a method for constructing dense and free subgroups in real Lie groups. In particular we show that any dense subgroup of a connected semisimple real Lie group G contains a free group on two generators which is still dense in G, and…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…