English
Related papers

Related papers: On epiC groups over language class C

200 papers

We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…

Group Theory · Mathematics 2021-02-11 Ramón Flores , José L. Rodríguez

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

Group Theory · Mathematics 2020-11-04 Mustafa Gökhan Benli , Burak Kaya

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…

Group Theory · Mathematics 2017-11-15 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages. In this paper we show that many of the languages…

Group Theory · Mathematics 2018-02-05 Laura Ciobanu , Murray Elder , Michal Ferov

Let $G$ be a finitely generated group, $\mathrm{Sub}(G)$ the (compact, metric) space of all subgroups of $G$ with the Chaubuty topology and $X!$ the (Polish) group of all permutations of a countable set $X$. We show that the following…

Group Theory · Mathematics 2014-09-17 Yair Glasner , Daniel Kitroser

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Group Theory · Mathematics 2012-12-05 Cristina Acciarri , Pavel Shumyatsky

Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…

Group Theory · Mathematics 2018-04-26 Robert H. Gilman , Robert P. Kropholler , Saul Schleimer

Suppose that $G$ is a topological group and $ C $ a compact subset of $G$. In this paper we define group nonexpansive mappings and then we consider $\sc = \{T_{i} : i \in I \}$ as a family of the group nonexpansive mappings on $C$. Also we…

Functional Analysis · Mathematics 2021-04-27 Ebrahim Soori , Ravi P. Agarwal , Donal O'Regan

We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…

Logic · Mathematics 2012-02-16 Dugald Macpherson , Katrin Tent

Let $w$ be a multilinear commutator word. In the present paper we describe recent results that show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely (or in some cases countably) many subgroups…

Group Theory · Mathematics 2017-03-06 Cristina Acciarri , Pavel Shumyatsky

A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field…

Group Theory · Mathematics 2024-02-13 Ievgen Bondarenko

We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…

Group Theory · Mathematics 2021-12-08 Isaac Goldbring , Srivatsav Kunnawalkam Elayavalli , Yash Lodha

It is proved that, in certain subgroups of direct products of countable groups, the property of being an unconditionally closed set coincides with that of being an algebraic set. In particular, these properties coincide in all Abelian…

Group Theory · Mathematics 2007-05-23 Ol'ga V. Sipacheva

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…

Logic · Mathematics 2023-08-25 Peter M. Higgins , Marcel Jackson

We embed a countably categorical group G into a locally compact group c(G) with a non-trivial topology and study how topological properties of c(G) are connected with the structure of definable subgroups of G.

Logic · Mathematics 2008-11-04 Al. A. Ivanov

A ring $R$ with center $C$ is said to be \textit{centrally essential} if the module $R_C$ is an essential extension of the module $C_C$. In the paper, we study groups whose group algebras over fields are centrally essential rings. We focus…

Rings and Algebras · Mathematics 2018-01-04 Victor Markov , Askar Tuganbaev

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Group Theory · Mathematics 2024-12-05 Jonathan Warne

For a language $L$, we consider its cyclic closure, and more generally the language $C^k(L)$, which consists of all words obtained by partitioning words from $L$ into $k$ factors and permuting them. We prove that the classes of ET0L and…

Formal Languages and Automata Theory · Computer Science 2016-05-31 Tara Brough , Laura Ciobanu , Murray Elder , Georg Zetzsche