First-order sentences in random groups II: $\forall\exists$-sentences

We prove that a random group, in Gromov’s density model with d<1/16 , satisfies with overwhelming probability a universal-existential first-order sentence \sigma (in the language of groups) if and only if \sigma is true in a nonabelian free group. It is remarked that one can also obtain the optimal result, that is, replace d<1/16 by d<1/2 .

Authors

Institutions

Publication Details

Journal
Groups Geometry and Dynamics
Published
2025-03-05
DOI
https://doi.org/10.4171/ggd/872
Primary Topic
Geometric and Algebraic Topology
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

First-order sentences in random groups II: $\forall\exists$-sentences

Olga Kharlampovich, Rizos Sklinos
Groups Geometry and Dynamics
Geometric and Algebraic Topology
article

First-order sentences in random groups II: $\forall\exists$-sentences

Olga Kharlampovich, Rizos Sklinos
article en

Abstract

We prove that a random group, in Gromov’s density model with d<1/16 , satisfies with overwhelming probability a universal-existential first-order sentence \sigma (in the language of groups) if and only if \sigma is true in a nonabelian free group. It is remarked that one can also obtain the optimal result, that is, replace d<1/16 by d<1/2 .

Groups Geometry and DynamicsVol. 19(3)
The Graduate Center, CUNY (US), Hunter College (US), Academy of Mathematics and Systems Science (CN)
Reduced inequalities
Openalex Percentile: Top 92%
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.