English
Related papers

Related papers: Words, Hausdorff dimension and randomly free group…

200 papers

Given an infinite topological group G and a cardinal k>0, we say that G is almost k-free if the set of k-tuples in G^k which freely generate free subgroups of G is dense in G^k. In this note we examine groups having this property and…

Group Theory · Mathematics 2011-10-05 Zachary Mesyan

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

Group Theory · Mathematics 2023-05-12 Amnon Rosenmann , Enric Ventura Capell

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

Group Theory · Mathematics 2010-07-06 Robert Gilman , Alexei Miasnikov , Denis Osin

We study the Hausdorff dimension of R-analytic subgroups in an R-analytic profinite group, where R is a pro-p ring whose asso- ciated graded ring is an integral domain. In particular, we prove that the set of such Hausdorff dimensions is a…

Group Theory · Mathematics 2016-05-25 Gustavo A. Fernández-Alcober , Eugenio Giannelli , Jon González-Sánchez

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

Group Theory · Mathematics 2019-09-11 Michael Larsen , Aner Shalev , Pham Huu Tiep

Let $G$ be a group. An element $g \in G$ is called a test element of $G$ if for every endomorphism $\varphi:G \to G$, $\varphi(g)=g$ implies that $\varphi$ is an automorphism. We prove that for a finitely generated profinite group $G$, $g…

Group Theory · Mathematics 2015-09-08 Ilir Snopce , Slobodan Tanushevski

We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…

Logic · Mathematics 2018-03-23 Adam R. Day

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

Group Theory · Mathematics 2007-09-02 Anton A. Klyachko

A finitely generated residually finite group $G$ is an $\widehat{OE}$-group if any action of its profinite completion $\widehat G$ on a profinite tree with finite edge stabilizers admits a global fixed point. In this paper, we study the…

Group Theory · Mathematics 2023-05-26 Vagner R. de Bessa , Anderson L. P. Porto , Pavel A. Zalesskii

We prove that the profinite completion of the fundamental group of a compact 3-manifold $M$ satisfies a Tits alternative: if a closed subgroup $H$ does not contain a free pro-$p$ subgroup for any $p$, then $H$ is virtually soluble, and…

Group Theory · Mathematics 2017-02-15 Henry Wilton , Pavel Zalesskii

Let F_k be the free group on k generators. A word w \in F_k is called primitive if it belongs to some basis of F_k. We investigate two criteria for primitivity, and consider more generally, subgroups of F_k which are free factors. The first…

Group Theory · Mathematics 2014-10-24 Doron Puder

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

Group Theory · Mathematics 2025-11-17 K. Auinger , J. Bitterlich , M. Otto

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has…

Group Theory · Mathematics 2024-10-18 Andrea Lucchini

Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension $I(\mathbf t)$ of the infinite Thue word satisfies $1/3\le I(\mathbf t)\le 2/3$. We improve that result by showing that…

Formal Languages and Automata Theory · Computer Science 2020-02-03 Kayleigh Hyde , Bjørn Kjos-Hanssen

To a finitely generated profinite group $G$, a formal Dirichlet series $P_G(s)=\sum_{n \in \mathbb N} {a_n(G)}/{n^s}$ is associated, where $a_n(G)=\sum_{|G:H|=n}\mu(H, G)$ and $\mu(H,G)$ denotes the M\"obius function of the lattice of open…

Group Theory · Mathematics 2020-05-15 Eloisa Detomi , Andrea Lucchini

Let G be a finite group of nilpotency class 2 and w a group word. In this short paper we show that the probability that a random n-tuple of elements from G satisfies w is at least one over the order of G. This answers a special case of a…

Group Theory · Mathematics 2011-01-25 Matthew Levy

In this article we prove that the arithmetic profinite iterated monodromy group of a post-critically infinite unicritical polynomial is regular branch (and so of positive Hausdorff dimension), and has positive fixed-point proportion when…

Group Theory · Mathematics 2026-02-26 Santiago Radi

We establish that finitely generated non-abelian direct products $G$ of free pro-$p$ groups have full Hausdorff spectrum with respect to the lower $p$-series $\mathcal{L}$. This complements similar results with respect to other standard…

Group Theory · Mathematics 2025-05-23 Iker de las Heras , Benjamin Klopsch , Anitha Thillaisundaram

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…

Group Theory · Mathematics 2020-02-18 Andrea Lucchini

We will give an example of a branch group $G$ that has exponential growth but does not contain any non-abelian free subgroups. This answers question 16 from \cite{Bartholdi} positively. The proof demonstrates how to construct a non-trivial…

Group Theory · Mathematics 2012-09-25 Elisabeth Fink
‹ Prev 1 4 5 6 7 8 10 Next ›