English
Related papers

Related papers: Context-Free Groups and Bass-Serre Theory

200 papers

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all…

Group Theory · Mathematics 2015-01-29 Laurent Bartholdi , Oleg Bogopolski

This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…

cmp-lg · Computer Science 2007-05-23 Marc Dymetman

Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.

Group Theory · Mathematics 2020-10-16 Henry Wilton

We study groups whose co-word problems are ET0L languages, which we call coET0L groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder. In particular we prove a number of closure results for the…

Group Theory · Mathematics 2026-02-25 Raad Al Kohli , Derek F. Holt , Sarah Rees

A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…

Group Theory · Mathematics 2014-12-30 Moon Duchin , Michael Shapiro

We define Euler characteristics on classes of residually finite and virtually torsion free groups and we show that they satisfy certain formulas in the case of amalgamated free products and HNN extensions over finite subgroups. These…

Group Theory · Mathematics 2016-07-19 Konstantinos Tsouvalas

Inspired by a series of papers initiated in 2015 by Berth\'e et al., we introduce a new condition called suffix-connectedness. We show that the groups generated by the return sets of a uniformly recurrent suffix-connected language lie in a…

Combinatorics · Mathematics 2022-08-19 Herman Goulet-Ouellet

We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…

Group Theory · Mathematics 2019-01-09 A. Caranti , F. Dalla Volta

This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…

Formal Languages and Automata Theory · Computer Science 2010-12-08 Laurent Bartholdi , Pedro V. Silva

In this note we prove that finitely generated virtually free groups are stable with respect to a normalized $p$-Schatten norm for $1\leq p < \infty$. In particular, this implies that virtually free groups are Hilbert-Schmidt stable.

Group Theory · Mathematics 2022-02-16 Maria Gerasimova , Konstantin Shchepin

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

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

Group Theory · Mathematics 2009-09-14 Alexey Muranov

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…

Group Theory · Mathematics 2009-09-25 Sarah Rees

This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.

Group Theory · Mathematics 2009-09-25 Robert Gilman

Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these…

cmp-lg · Computer Science 2008-02-03 Marc Dymetman

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

Group Theory · Mathematics 2017-12-14 Mark Brittenham , Susan Hermiller , Tim Susse

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…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

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

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

Group Theory · Mathematics 2022-07-01 Andrew Velasquez-Berroteran
‹ Prev 1 4 5 6 7 8 10 Next ›