相关论文: Sentences over Random Groups II: Sentences of Mini…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

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…

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We study the rigidity of the volume entropy for weighted word metrics on hyperbolic groups, building on a recent convexity result due to Cantrell-Tanaka. Using ideas from small cancellation theory, we give conditions under which a…

We show that a first-order sentence is almost surely true in a random group of density d<1/2 if and only if it is true in a non-abelian free group.

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

We prove that a random group, in Gromov's density model with $d<1/16$, satisfies a universal sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a nonabelian free group.

We show that each level of the quantifier alternation hierarchy within FO^2[<] -- the 2-variable fragment of the first order logic of order on words -- is a variety of languages. We then use the notion of condensed rankers, a refinement of…

Suppose $G$ is a 1-ended finitely generated group that is hyperbolic relative to P a finite collection of 1-ended finitely generated subgroups. Our main theorem states that if the boundary $\partial (G, P)$ has no cut point, then $G$ has…

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing…

It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there…

Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…

We give experimental support for a conjecture of Louder and Wilton saying that words of imprimitivity rank greater than two yield hyperbolic one-relator groups.

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…