English
Related papers

Related papers: Scott sentences for certain groups

200 papers

Birman-Lubotzky-McCarthy proved that any abelian subgroup of the mapping class groups for orientable surfaces is finitely generated. We apply Birman-Lubotzky-McCarthy's arguments to the mapping class groups for non-orientable surfaces. We…

Geometric Topology · Mathematics 2021-07-27 Erika Kuno

A regular set of words is ($k$-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length $k$. In this article we study groups for which the set of all geodesic words with respect…

Group Theory · Mathematics 2011-11-04 S. Hermiller , Derek F. Holt , Sarah Rees

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

This work concerns finite free complexes over commutative noetherian rings, in particular over group algebras of elementary abelian groups. The main contribution is the construction of complexes such that the total rank of their underlying…

Commutative Algebra · Mathematics 2018-05-11 Srikanth B. Iyengar , Mark E. Walker

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Group Theory · Mathematics 2011-06-02 René Hartung

Let G be an abelian group. For a subset A of G, Cyc(A) denotes the set of all elements x of G such that the cyclic subgroup generated by x is contained in A, and G is said to have the small subgroup generating property (abbreviated to SSGP)…

General Topology · Mathematics 2018-12-27 Dmitri Shakhmatov , Víctor Hugo Yañez

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

Logic · Mathematics 2008-04-21 Abderezak Ould Houcine

In this note, we construct torsion-free countable, amenable, weakly mixing groups, which answer a question of V. Bergelson. Some results related to verbal subgroups and crystallographic groups are also presented.

Dynamical Systems · Mathematics 2016-07-04 Rostislav Grigorchuk , Rostyslav Kravchenko , Alexander Olshanskii

A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the…

Group Theory · Mathematics 2025-04-02 Keivan Mallahi-Karai , Maryam Mohammadi Yekta

In this article, we examine how the structure of soluble groups of infinite torsion-free rank with no section isomorphic to the wreath product of two infinite cyclic groups can be analysed. As a corollary, we obtain that if a finitely…

Group Theory · Mathematics 2018-05-30 Lison Jacoboni , Peter Kropholler

We present novel constructions concerning the homology of finitely generated groups. Each construction draws on ideas of Gilbert Baumslag. There is a finitely presented acyclic group $U$ such that $U$ has no proper subgroups of finite index…

Group Theory · Mathematics 2019-12-11 Martin R Bridson

We give a computational approach to theorem proving in homological algebra. This approach is based on computations in the free abelian category of an additive category $\mathbf{A}$. We show that the free abelian category is amenable to…

Category Theory · Mathematics 2021-03-16 Sebastian Posur

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

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

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Logic · Mathematics 2016-09-13 André Nies , Andrea Sorbi

Every torsion--free abelian group of finite rank has two essentially unique complete direct decompositions whose summands come from specific classes of groups.

Group Theory · Mathematics 2020-07-16 Phill Schultz

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

Representation Theory · Mathematics 2024-12-30 Anatolii V. Tushev

We identify the simple algebraic groups over number fields that are, in a suitable sense, determined by their finite adele points. Assuming CSP and Grothendieck rigidity, our results essentially characterize higher rank arithmetic groups…

Group Theory · Mathematics 2026-05-06 Adrian Baumann , Holger Kammeyer

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

Logic · Mathematics 2026-01-27 Gianluca Paolini , Saharon Shelah

For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…

Logic · Mathematics 2024-06-05 David Gonzalez , Matthew Harrison-Trainor , Meng-Che "Turbo" Ho
‹ Prev 1 4 5 6 7 8 10 Next ›