The Borel reducibility conjecture for Bratteli diagrams of exact rank

At least 8 years old · documented by

For each n≥1n\geq 1, let BDn∗\mathcal{BD}^*_n be the class of Bratteli diagrams of exact rank nn, and let BDn∗BD^*_n be the equivalence relation induced by equivalence of Bratteli diagrams on BDn∗\mathcal{BD}^*_n. The exact-rank Bratteli-diagram conjecture. For n≥1n\geq 1,

BDn∗≤BBDn+1∗.BD^*_n\leq_B BD^*_{n+1}.

Consequently, for n≥3n\geq 3, BDn∗<BBDn+1∗BD^*_n<_B BD^*_{n+1}. The reverse nonreducibility for n≥3n\geq 3 is already obtained in the source, but the displayed reducibility was not known there; the conjecture would therefore give strictness in those cases.

References

Primary source

Paul Ellis, “The Classification Problem for Simple Unital Finite Rank Dimension Groups”, arXiv:1709.06684 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.