ℵ<sub>0</sub>-categorical structures with arbitrarily fast growth of algebraic closure (Q4779639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1836115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ℵ<sub>0</sub>-categorical structures with arbitrarily fast growth of algebraic closure |
scientific article; zbMATH DE number 1836115 |
Statements
ℵ<sub>0</sub>-categorical structures with arbitrarily fast growth of algebraic closure (English)
0 references
21 June 2003
0 references
\(\aleph _0\)-categorical structures
0 references
algebraic closure
0 references
automorphism group
0 references
first-order language
0 references
0 references
0.9090208
0 references
0.90405285
0 references
0.9002519
0 references
0.8939432
0 references
0.89200747
0 references
0.8899805
0 references
0.8897417
0 references
Let \({\mathcal M}\) be an \(\aleph _0\)-categorical structure and \(X\) be a finite subset of \({\mathcal M}\). Let \(\text{acl}(X)\) be the algebraic closure of \(X\). Define \[ b_n=b_n({\mathcal M})=\max \{ |\text{acl}(X)|: X\subseteq {\mathcal M}, |X|=n \} . \] \textit{H. D. Macpherson} [Q. J. Math., Oxf. 37, 449-465 (1986; Zbl 0611.03014)] posed the following problem: Given any sequence \((a_n)_{n\in {\mathbb N}}\), is it always possible to find a transitive \(\aleph _0\)-categorical structure \({\mathcal M}\) such that \(b_n \geq a_n\) for every \(n\)? In this paper, as answer to this problem, the authors prove the following result: For every sequence \((a_n)_{n\in {\mathbb N}}\) and every \(k\in {\mathbb N}, k\geq 2\), there exists a \((k-1)\)-transitive, countable, \(\aleph _0\)-categorical \(k\)-uniform hypergraph \({\mathcal M}\) such that for each \(n>k\), there exists \(A_n\subseteq {\mathcal M}\) with \(|A_n|=n\) and \(|\text{acl}(A_n)|\geq a_n\).
0 references