Coxeter groups and abstract elementary classes: the right-angled case
T Hyttinen, G Paolini - 2019 - projecteuclid.org
T Hyttinen, G Paolini
2019•projecteuclid.orgWe study classes of right-angled Coxeter groups with respect to the strong submodel
relation of a parabolic subgroup. We show that the class of all right-angled Coxeter groups is
not smooth and establish some general combinatorial criteria for such classes to be abstract
elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove
two combinatorial conditions ensuring the strong rigidity of a right-angled Coxeter group of
arbitrary rank. The combination of these results translates into a machinery to build concrete …
relation of a parabolic subgroup. We show that the class of all right-angled Coxeter groups is
not smooth and establish some general combinatorial criteria for such classes to be abstract
elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove
two combinatorial conditions ensuring the strong rigidity of a right-angled Coxeter group of
arbitrary rank. The combination of these results translates into a machinery to build concrete …
Abstract
We study classes of right-angled Coxeter groups with respect to the strong submodel relation of a parabolic subgroup. We show that the class of all right-angled Coxeter groups is not smooth and establish some general combinatorial criteria for such classes to be abstract elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove two combinatorial conditions ensuring the strong rigidity of a right-angled Coxeter group of arbitrary rank. The combination of these results translates into a machinery to build concrete examples of AECs satisfying given model-theoretic properties. We exhibit the power of our method by constructing three concrete examples of finitary classes. We show that the first and third classes are nonhomogeneous and that the last two are tame, uncountably categorical, and axiomatizable by a single -sentence. We also observe that the isomorphism relation of any countable complete first-order theory is -Borel reducible (in the sense of generalized descriptive set theory) to the isomorphism relation of the theory of right-angled Coxeter groups whose Coxeter graph is an infinite random graph.

Showing the best result for this search. See all results