Search arXivSearch

arXiv · 0809.3441

Superstable groups acting on trees

Abstract

We study superstable groups acting on trees. We prove that an action of an $ω$-stable group on a simplicial tree is trivial. This shows that an HNN-extension or a nontrivial free product with amalgamation is not $ω$-stable. It is also shown that if $G$ is a superstable group acting nontrivially on a $Λ$-tree, where $Λ=\mathbb Z$ or $Λ=\mathbb R$, and if $G$ is either $α$-connected and $Λ=\mathbb Z$, or if the action is irreducible, then $G$ interprets a simple group having a nontrivial action on a $Λ$-tree. In particular if $G$ is superstable and splits as $G=G_1*_AG_2$, with the index of $A$ in $G_1$ different from 2, then $G$ interprets a simple superstable non $ω$-stable group. We will deal with "minimal" superstable groups of finite Lascar rank acting nontrivially on $Λ$-trees, where $Λ=\mathbb Z$ or $Λ=\mathbb R$. We show that such groups $G$ have definable subgroups $H_1 \lhd H_2 \lhd G$, $H_2$ is of finite index in $G$, such that if $H_1$ is not nilpotent-by-finite then any action of $H_1$ on a $Λ$-tree is trivial, and $H_2/H_1$ is either soluble or simple and acts nontrivially on a $Λ$-tree. We are interested particularly in the case where $H_2/H_1$ is simple and we show that $H_2/H_1$ has some properties similar to those of bad groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Abderezak Ould Houcine. 2008-09-19. Superstable groups acting on trees. https://arxiv.org/abs/0809.3441

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO