Sentences over Random Groups II: Sentences of Minimal Rank

Abstract

Random groups of density d<12 are infinite hyperbolic, and of density d>12 are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the theory). Namely, given a minimal rank formula V(p), we prove the existence of a formula (p) that belongs to the Boolean algebra of two quantifiers, so that the two formulas V(p) and (p) define the same set over the free group Fk and over a random group of density d<12. We conclude that any given sentence of minimal rank is a truth sentence over the free group Fk if and only if it is a truth sentence over random groups of density d<12.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…