Shaun Allison

activity

20202024

most citedNon-Archimedean TSI Polish groups and their potential Borel complexity spectrum

3 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.LO2023

Countable Borel treeable equivalence relations are classifiable by $ℓ_{1}$

Shaun Allison

Gao and Jackson showed that any countable Borel equivalence relation (CBER) induced by a countable abelian Polish group is hyperfinite. This prompted Hjorth to ask if this is in fa…

math.LO2023

Classification Strength of Polish Groups: Involving $S_{\infty}$

Shaun Allison

In recent years, much work has been done to measure and compare the complexity of orbit equivalence relations, especially for certain classes of Polish groups. We start by introduc…

Countable Borel treeable equivalence relations are classifiable by ℓ1​

Classification Strength of Polish Groups: Involving S∞​

Countable Borel treeable equivalence relations are classifiable by $ℓ_{1}$

Classification Strength of Polish Groups: Involving $S_{\infty}$