Answers are grounded in this paper and cite their sources.
In Kechris et al. [J. Symb. Log. 83 (2018), no. 3, 1190–1203], it was asked if equality on the reals is sharp as a lower bound for the complexity of topological isomorphism between oligomorphic groups. We prove that under the assumption of weak elimination of imaginaries, this is indeed the case. Our methods are model theoretic and they also have applications on the classical problem of reconstruction of isomorphisms of permutation groups from (topological) isomorphisms of automorphisms groups. As a concrete application, we give an explicit description of for any vector space of dimension over a finite field, in affinity with the classical description for finite‐dimensional spaces due to Schreier and van der Waerden.
No takes yet. Share an insight, caveat, or question.
Gianluca Paolini (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: