Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1411.0510

A model theoretic study of right-angled buildings

Andreas Baudisch·Amador Martin-Pizarro·Martin Ziegler
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the model theory of countable right-angled buildings with infinite residues. For every Coxeter graph we obtain a complete theory with a natural axiomatisation, which is $ω$-stable and equational. Furthermore, we provide sharp lower and upper bounds for its degree of ampleness, computed exclusively in terms of the associated Coxeter graph. This generalises and provides an alternative treatment of the free pseudospace.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Baudisch, Amador Martin-Pizarro, Martin Ziegler. 2017-08-16. A model theoretic study of right-angled buildings. https://doi.org/10.4171/jems%2F736

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

KEEP EXPLORING

Related papers

arXiv2026

Failure of the $G_0$-dichotomy for generalized Cantor spaces

Kechris, Solecki and Todorčević's $G_0$-dichotomy characterizes Borel graphs that admit a Borel measurable coloring with countably many colors. We show that the analogue to the $G_0$-dichotomy for generalized Cantor spaces fails at the lowest possible complexity, namely for closed graphs.

math.LO↗
arXiv2026

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↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $λ$-terraced cube relation fails whenever $λ$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $λ$. If $λ$ 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↗