English
Related papers

Related papers: The word problem for some uncountable groups given…

200 papers

We prove that if $L=\mbox{}^2F_4(2^{2n+1})'$ and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the…

Group Theory · Mathematics 2023-08-01 Danila O. Revin , Andrei V. Zavarnitsine

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Using spaces of homomorphisms and the descending central series of the free groups, simplicial spaces are constructed for each integer q>1 and every topological group G, with realizations B(q,G) that filter the classifying space BG. In…

Algebraic Topology · Mathematics 2011-09-14 Alejandro Adem , Frederick R. Cohen , Enrique Torres-Giese

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

Group Theory · Mathematics 2013-12-19 Michael Larsen , Pham Huu Tiep

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

Formal Languages and Automata Theory · Computer Science 2024-03-13 Maximilian Kotowsky , Jan Philipp Wächter

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 construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

In this paper, we formulate an analogue of Waring's problem for an algebraic group $G$. At the field level we consider a morphism of varieties $f\colon \mathbb{A}^1\to G$ and ask whether every element of $G(K)$ is the product of a bounded…

Number Theory · Mathematics 2017-07-26 Michael Larsen , Dong Quan Ngoc Nguyen

This paper is devoted to the study of a natural group topology on the fundamental group which remembers local properties of spaces forgotten by covering space theory and weak homotopy type. It is known that viewing the fundamental group as…

Algebraic Topology · Mathematics 2020-04-14 Jeremy Brazas

Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…

Group Theory · Mathematics 2011-02-15 Jane Gilman , Linda Keen

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Representation Theory · Mathematics 2025-07-08 Dmitry Fuchs , Alexandre Kirillov

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…

Logic · Mathematics 2020-06-16 Valentino Delle Rose , Luca San Mauro , Andrea Sorbi

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the \emph{limited} equivalence problem for unambiguous grammars -- for two unambiguous grammars $G_1$ and…

Formal Languages and Automata Theory · Computer Science 2022-12-08 Vladislav Makarov

We prove finite generation of the cohomology ring of any finite dimensional pointed Hopf algebra, having abelian group of grouplike elements, under some mild restrictions on the group order. The proof uses the recent classification by…

Rings and Algebras · Mathematics 2014-02-26 M. Mastnak , J. Pevtsova , P. Schauenburg , S. Witherspoon

We prove several new theorems regarding first homology. Some dichotomies for first homology of Peano continua are presented, as well as a notion of strong abelianization for arbitrary path connected metric spaces. We also show that the…

Algebraic Topology · Mathematics 2020-10-07 Samuel M. Corson

In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…

Group Theory · Mathematics 2011-03-09 Cristóbal Rivas

We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Jennifer Taback

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel