English
Related papers

Related papers: The intersection of subgroups in free groups and l…

200 papers

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $\phi$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $\lambda(\phi)$, which is a…

Group Theory · Mathematics 2007-05-23 Vadim Kaimanovich , Ilya Kapovich , Paul Schupp

We prove that if $N\ge 2$ and $\alpha: F_N\to \pi_1(\Gamma)$ is a marking on $F_N$, then for any integer $r\ge 2$ and any $F_N$-invariant collection of non-negative integral "weights" associated to all subtrees $K$ of $\widetilde \Gamma$ of…

Group Theory · Mathematics 2016-12-08 Ilya Kapovich

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

Group Theory · Mathematics 2019-07-04 Pierre-Emmanuel Caprace , Peter H. Kropholler , Colin D. Reid , Phillip Wesolek

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Group Theory · Mathematics 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

Group Theory · Mathematics 2023-06-23 Victor S. Monakhov , Irina L. Sokhor

Let $G$ be a finite group and recall that the Frattini subgroup ${\rm Frat}(G)$ is the intersection of all the maximal subgroups of $G$. In this paper, we investigate the intersection number of $G$, denoted $\alpha(G)$, which is the minimal…

Group Theory · Mathematics 2021-11-23 Timothy C. Burness , Martino Garonzi , Andrea Lucchini

For every $\alpha \in [1,2r-1]$, we show there exists a subgroup $H<F_r$ whose growth rate is $\alpha$.

Group Theory · Mathematics 2025-05-19 Michail Louvaris , Daniel T. Wise , Gal Yehuda

The generalized Fitting height $h^*(G)$ of a finite group $G$ is the least number $h$ such that $\mathrm{F}_h^* (G) = G$, where $\mathrm{F}_{(0)}^* (G) = 1$, and $\mathrm{F}_{(i+1)}^*(G)$ is the inverse image of the generalized Fitting…

Group Theory · Mathematics 2023-01-06 Viachaslau I. Murashka , Alexander F. Vasil'ev

A subgroup $H$ of a free group $F$ is called inert in $F$ if for every $G < F$ the rank of the intersection of $H$ with $G$ is no grater than the rank of $G$. In this paper we expand the known families of inert subgroups. We show that the…

Group Theory · Mathematics 2014-12-23 Amnon Rosenmann

We study a family of finitely generated residually finite groups. These groups are doubles $F_2*_H F_2$ of a rank-$2$ free group $F_2$ along an infinitely generated subgroup $H$. Varying $H$ yields uncountably many groups up to isomorphism.

Group Theory · Mathematics 2022-07-11 Hip Kuen Chong , Daniel T. Wise

The free product of an arbitrary pair of finite hyperfinite von Neumann algebras is examined, and the result is determined to be the direct sum of a finite dimensional algebra and an interpolated free group factor $L(\freeF_r)$. The finite…

funct-an · Mathematics 2008-02-03 Ken Dykema

The intersection cut framework was introduced by Balas in 1971 as a method for generating cutting planes in integer optimization. In this framework, one uses a full-dimensional convex $S$-free set, where $S$ is the feasible region of the…

Optimization and Control · Mathematics 2023-09-27 Gonzalo Muñoz , Joseph Paat , Felipe Serrano

We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…

Group Theory · Mathematics 2024-12-05 Severin Mejak , David Schrittesser

We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presentability of subdirect products of groups: if $\Gamma_1,...,\Gamma_n$ are finitely presented and $S<\Gamma_1\times...\times\Gamma_n$ projects…

Group Theory · Mathematics 2025-07-16 Martin R. Bridson , James Howie , Charles F. Miller , Hamish Short

We prove that for arbitrary two finitely generated subgroups A and B having infinite index in a free group F, there is a subgroup H of finite index in B such that the subgroup generated by A and H has infinite index in F. The main corollary…

Group Theory · Mathematics 2013-08-15 A. Yu. Olshanskii

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

Group Theory · Mathematics 2007-05-23 L. Markus-Epstein

Let $p$ be a prime and $q = p^k$. A subset $\mathcal{F} \subset \operatorname{\Gamma L}_{2}(q)$ is intersecting if any two semilinear transformations in $\mathcal{F}$ agree on some non-zero vector in $\mathbb{F}_q^2$. We show that any…

Combinatorics · Mathematics 2024-02-28 Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…

Group Theory · Mathematics 2007-07-02 L. Markus-Epstein

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina