English
Related papers

Related papers: Star-free geodesic languages for groups

200 papers

We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free…

Formal Languages and Automata Theory · Computer Science 2017-01-16 Robert Ferens , Marek Szykuła

Most of the examples of wavelet sets are for dilation sets which are groups. We find a necessary and sufficient condition under which subspace wavelet sets exist for dilation sets of the form $A B$, which are not necessarily groups. We…

Functional Analysis · Mathematics 2007-10-19 Mihaela Dobrescu , Gestur Olafsson

We show that the abelian monoid of isomorphism classes of G-stable finite S-sets is free for a finite group G with Sylow p-subgroup S; here a finite S-set is called G-stable if it has isomorphic restrictions to G-conjugate subgroups of S.…

Group Theory · Mathematics 2015-11-20 Sune Precht Reeh

We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language. In particular, the set of all solutions in reduced words is an indexed…

Group Theory · Mathematics 2016-05-24 Laura Ciobanu , Volker Diekert , Murray Elder

Does every one-ended $CAT(0)$ group have semistable fundamental group at infinity? As we write, this is an open question. Let $G$ be such a group acting geometrically on the proper $CAT(0)$ space $X$. In this paper we show that in order to…

Group Theory · Mathematics 2020-10-14 Ross Geoghegan , Eric Swenson

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

Group Theory · Mathematics 2021-08-31 Murray Elder , Adam Piggott

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Group Theory · Mathematics 2025-05-05 Martina Conte , Jan Moritz Petschick

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov

A conjugation-free geometric presentation of a fundamental group is a presentation with the natural topological generators $x_1, ..., x_n$ and the cyclic relations: $x_{i_k}x_{i_{k-1}} ... x_{i_1} = x_{i_{k-1}} ... x_{i_1} x_{i_k} = ... =…

Geometric Topology · Mathematics 2012-06-08 Meital Eliyahu , David Garber , Mina Teicher

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 introduce a theory of "patterns" in order to study geodesics in a certain class of group presentations. Using patterns we show that there does not exist a geodesic automatic structure for certain group presentations, and that certain…

Group Theory · Mathematics 2012-05-16 Murray J Elder

One version of Whitehead's famous cut vertex lemma says that if an element of a free group is part of a free basis, then a certain graph associated to its conjugacy class that we call the star graph is either disconnected or has a cut…

Group Theory · Mathematics 2025-01-09 Rylee Alanza Lyman

Given an aleph_1-free abelian group G we characterize the class C_G of all torsion abelian groups T satisfying Ext(G,T)=0 assuming the continuum hypothesis CH. Moreover, in Godel's constructable universe we prove that this characterizes C_G…

Logic · Mathematics 2007-05-23 Saharon Shelah , Lutz Strüngmann

We conjecture that satellite operations are either constant or have infinite rank in the concordance group. We reduce this to the difficult case of winding number zero satellites, and use $SO(3)$ gauge theory to provide a general criterion…

Geometric Topology · Mathematics 2021-01-05 Matthew Hedden , Juanita Pinzon-Caicedo

The class of Church-Rosser congruential languages has been introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential (belongs to CRCL), if there is a finite, confluent, and length-reducing semi-Thue…

Formal Languages and Automata Theory · Computer Science 2012-08-28 Volker Diekert , Manfred Kufleitner , Pascal Weil

FC is a first-order logic that reasons over all factors of a finite word using concatenation, and can define non-regular languages like that of all squares (ww). In this paper, we establish that there are regular languages that are not…

Logic in Computer Science · Computer Science 2025-12-23 Sam M. Thompson , Nicole Schweikardt , Dominik D. Freydenberger

Let us call pseudo-homothetic group the non-unimodular 3-dimensional Lie group that is the semi-direct product of $\mathbb{R}$ acting non-semisimply on $\mathbb{R}^2$. In this article, we solve the geodesic completeness problem on this Lie…

Differential Geometry · Mathematics 2025-09-11 Salah Chaib , Ana Cristina Ferreira , Abdelghani Zeghib

We consider faithful actions of simple algebraic groups on self-dual irreducible modules, and on the associated varieties of totally singular subspaces, under the assumption that the dimension of the group is at least as large as the…

Group Theory · Mathematics 2025-01-29 Aluna Rizzoli

We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.

Group Theory · Mathematics 2025-04-30 Olga Kharlampovich , Alexei Miasnikov

We consider non-elementary representations of two generator free groups in $PSL(2,\mathbb{C})$, not necessarily discrete or free, $G = < A, B >$. A word in $A$ and $B$, $W(A,B)$, is a palindrome if it reads the same forwards and backwards.…

Geometric Topology · Mathematics 2008-08-27 Jane Gilman , Linda Keen