2 citations · 7 across the 15 of their papers we have counts for
Showing 2026 · math.LOShow all
2 papers · 2 filters
math.LO2026
On the complexity of extensions of non-archimedean Polish groups admitting a compatible complete left-invariant metric
Longyun Ding, Xu Wang
In this article, motivated by a problem asked by Allison and Panagiotopoulos, we study a problem concerning the complexity of group extensions within a hierarchy (denoted by -CL…
math.LO2026
Complete orbit equivalence relation and non-universal Polish groups
Longyun Ding, Ruiwen Li, Bo Peng
We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from \cite{OPENPROBLEMS}.