English
Related papers

Related papers: Star-free geodesic languages for groups

200 papers

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a…

Group Theory · Mathematics 2022-12-07 Ash DeClerk

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

A necessary and sufficient condition for the simplicity of the C*-algebra reduced free product of finite dimensional abelian algebras is found, and it is proved that the stable rank of every such free product is 1. Related results about…

funct-an · Mathematics 2008-02-03 Kenneth J. Dykema

Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…

Group Theory · Mathematics 2020-03-31 Tara Brough

Given a word $w$ over a finite alphabet, we consider, in three special cases, the generalised star-height of the languages in which $w$ occurs as a contiguous subword (factor) an exact number of times and of the languages in which $w$…

Formal Languages and Automata Theory · Computer Science 2016-09-28 Tom Bourne , Nik Ruskuc

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function…

Formal Languages and Automata Theory · Computer Science 2011-09-16 Janusz Brzozowski , Baiyu Li

Let $G$ be a fundamental group of a graph of group where the graph is a rose or a star graph and the vertex groups are free groups, free abelian groups or right-angled Artin groups. We prove the linearity of $G$ over $\mathbb{Z}$ under…

Group Theory · Mathematics 2025-06-12 D. Tsipa

We give a language of unique geodesic normal forms for the Baumslag-Solitar group BS(1,2) that is context-free and 1-counter. We discuss the classes of context-free, 1-counter and counter languages, and explain how they are inter-related.

Group Theory · Mathematics 2012-05-16 Murray Elder

We consider a question of Edjvet and Vdovina concerning which groups defined by special presentations are large. For each integer $n \ge 3$, we construct an $n$-generator one-relator presentation whose star graph is the complete bipartite…

Group Theory · Mathematics 2026-05-28 Bridgette Amoako , Ihechukwu Chinyere , Bernard Bainson

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Combinatorics · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

We study the generic properties of finitely presented monoids and semigroups. We show that for positive integers a > 1, k and m, the generic a-generator k-relation monoid and semigroup presentation (defined in any of several definite…

Rings and Algebras · Mathematics 2008-07-09 Mark Kambites

A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…

Formal Languages and Automata Theory · Computer Science 2018-01-04 Janusz A. Brzozowski , Sylvie Davies

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

Group Theory · Mathematics 2025-04-01 André Carvalho , Carl-Fredrik Nyberg-Brodda

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

Group Theory · Mathematics 2007-05-23 Nikolay Nikolov , Dan Segal

We prove that finitely generated amenable groups acting on CAT(0) spaces satisfy the following alternative: either every action on a geodesically complete CAT(0) space with bounded geometry (or finite dimension) has a global fixed point, or…

Group Theory · Mathematics 2026-03-30 Hiroyasu Izeki , Ran Ji , Anders Karlsson , Yunhui Wu

We construct generating pairs of simple Lie algebras in characteristic zero. We apply this construction to exhibit infinite series of 2-generator Zariski dense subgroups that are free of rank 2 of the simple algebraic groups SL(n, C), Sp(n,…

Rings and Algebras · Mathematics 2019-05-15 Alla S. Detinko , Willem A. de Graaf

For a finitely generated group $G$, let $H(G)$ denote Bowditch's taut loop length spectrum. We prove that if $G=(A\ast B) / \langle\!\langle \mathcal R \rangle\!\rangle $ is a $C'(1/12)$ small cancellation quotient of a the free product of…

Group Theory · Mathematics 2021-12-16 Eduardo Martínez-Pedroza , Luis Jorge Sánchez Saldaña

$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…

Group Theory · Mathematics 2021-04-22 Daniel Herden , Alexandra V. Pasi

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…