English
Related papers

Related papers: Polygonal words in free groups

200 papers

For a given finite group $G$ consisting of morphisms and antimorphisms of a free monoid $\mathcal{A}^*$, we study infinite words with language closed under the group $G$. We focus on the notion of $G$-richness which describes words rich in…

Combinatorics · Mathematics 2015-03-19 Edita Pelantová , Štěpán Starosta

The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…

Group Theory · Mathematics 2011-06-07 Markus Lohrey

We prove that a word hyperbolic group whose Gromov boundary properly contains a $2$-sphere cannot admit a projective Anosov representation into $\mathsf{Sp}_{2m}(\mathbb{C})$, $m\in \mathbb{N}$. We also prove that a word hyperbolic group…

Geometric Topology · Mathematics 2023-05-10 Maria Beatrice Pozzetti , Konstantinos Tsouvalas

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

Group Theory · Mathematics 2015-06-12 Tamer Tlas

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

Group Theory · Mathematics 2014-05-14 Tomasz Odrzygóźdź

We obtain a number of finiteness results for groups acting on Gromov-hyperbolic spaces. In particular we show that a torsion-free locally quasiconvex hyperbolic group has only finitely many conjugacy classes of $n$-generated one-ended…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

Group Theory · Mathematics 2009-10-21 Jeremy Macdonald

For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…

Group Theory · Mathematics 2020-09-23 V. H. Mikaelian

We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…

Geometric Topology · Mathematics 2014-02-26 Mark Baker , Daryl Cooper

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

Group Theory · Mathematics 2007-05-23 Robert H. Gilman , Derek F. Holt , Sarah Rees

For a prime number $p$ and a free pro-$p$ group $G$ on a totally ordered basis $X$, we consider closed normal subgroups $G^\Phi$ of $G$ which are generated by $p$-powers of iterated commutators associated with Lyndon words in the alphabet…

Number Theory · Mathematics 2024-01-04 Ido Efrat

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

Group Theory · Mathematics 2008-04-07 Danny Calegari

The aim of this paper is to demonstrate that very many Dehn fillings on a cusped hyperbolic 3-manifold yield a 3-manifold which is irreducible, atoroidal and not Seifert fibred, and which has infinite, word hyperbolic fundamental group. We…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

Group Theory · Mathematics 2025-02-10 Jonathan Warne

Let $\Sigma$ be a surface of negative Euler characteristic and $S$ a generating set for $\pi_1(\Sigma,p)$ consisting of simple loops that are pairwise disjoint (except at $p$). We show that the word length with respect to $S$ of an element…

Geometric Topology · Mathematics 2018-03-09 Viveka Erlandsson

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

Group Theory · Mathematics 2015-11-04 Derek F. Holt , Sarah Rees

We study algebraic closure and its relation with definable closure in free groups and more generally in torsion-free hyperbolic groups. Given a torsion-free hyperbolic group G and a nonabelian subgroup A of G, we describe G as a…

Group Theory · Mathematics 2012-05-15 A. Ould Houcine , D. Vallino

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

Group Theory · Mathematics 2020-06-23 Laurent Bartholdi , Michael Figelius , Markus Lohrey , Armin Weiß
‹ Prev 1 3 4 5 6 7 10 Next ›