Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1308.5517

The infinite random simplicial complex

Andrew Brooke-Taylor·Damiano Testa
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the Fraisse limit of the class of all finite simplicial complexes. Whilst the natural model-theoretic setting for this class uses an infinite language, a range of results associated with Fraisse limits of structures for finite languages carry across to this important example. We introduce the notion of a local class, with the class of finite simplicial complexes as an archetypal example, and in this general context prove the existence of a 0-1 law and other basic model-theoretic results. Constraining to the case where all relations are symmetric, we show that every direct limit of finite groups, and every metrizable profinite group, appears as a subgroup of the automorphism group of the Fraisse limit. Finally, for the specific case of simplicial complexes, we show that the geometric realisation is topologically surprisingly simple: despite the combinatorial complexity of the Fraisse limit, its geometric realisation is homeomorphic to the infinite simplex.

Explore related subjects

math.LOmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Brooke-Taylor, Damiano Testa. 2013-08-26. The infinite random simplicial complex. https://arxiv.org/abs/1308.5517

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

KEEP EXPLORING

Related papers

arXiv2026

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO↗
arXiv2026

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO↗
arXiv2026

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO↗